@misc {IOPORT.03934807,
    author       = {Philpott, A.B.},
    title        = {Network programming in continuous time with node storage.},
    howpublished = {Infinite programming, Proc. Int. Symp., Cambridge/U.K. 1984, Lect. Notes Econ. Math. Syst. 259, 136-153 (1985).},
    year         = {1985},
    abstract     = {[For the entire collection see Zbl 0569.00009.] Given a network having costs and upper bound constraints on the flows in its arcs, the minimum-cost network flow problem is that of finding flows which satisfy a flow-conservation constraint at each node and minimize the total cost of flow. If the arc capacities and costs are allowed to vary as functions of time, and storage is permitted (with some incurred cost) at the nodes of the network, then the problem becomes an infinite- dimensional linear program with a network structure. We describe some preliminary work on the development of an algorithm to solve such problems. This algorithm is a continuous version of the network simplex algorithm.},
    identifier   = {03934807},
}