, Network Flows, 1993.
, A Class of Continuous Network Flow Problems, See also the Erratum in Math, pp.501-514478, 1982.
DOI : 10.1287/moor.7.4.501
, Optimisation of flows in networks over time, Probability, statistics and optimisation, pp.369-382, 1994.
, A survey of dynamic network flows, Annals of Operations Research, vol.26, issue.2, pp.1-66, 1989.
DOI : 10.1007/BF02216922
, A forward network simplex algorithm for solving multiperiod network flow problems, Naval Research Logistics Quarterly, vol.15, issue.3, pp.445-467, 1986.
DOI : 10.1002/nav.3800330310
, The dynamic transportation problem: A survey, Naval Research Logistics Quarterly, vol.11, issue.1, pp.65-87, 1980.
DOI : 10.1002/nav.3800270107
, COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS, International Journal of Foundations of Computer Science, vol.14, issue.02, pp.267-285, 2003.
DOI : 10.1142/S0129054103001728
URL : https://hal.archives-ouvertes.fr/inria-00071996
, The quickest flow problem. ZOR Methods and Models of Operations Research, pp.31-58, 1993.
, On models and algorithms for dynamic communication networks: The case for evolving graphs, Proceedings of rencontres francophones sur les Aspects Algorithmiques des Télécommunications (ALGOTEL'2002), pp.155-161, 2002.
, Faster Algorithms for the Quickest Transshipment Problem, SIAM Journal on Optimization, vol.12, issue.1, pp.18-35, 2001.
DOI : 10.1137/S1052623497327295
, Universally maximum flow with piecewise-constant capacities, Networks, vol.19, issue.3, pp.115-125, 2001.
DOI : 10.1002/net.1030
, Optimal Rounding of Instantaneous Fractional Flows Over Time, SIAM Journal on Discrete Mathematics, vol.13, issue.2, pp.145-153, 2000.
DOI : 10.1137/S0895480198344138
, The Quickest Multicommodity Flow Problem, Integer Programming and Combinatorial Optimization, pp.36-53, 2002.
DOI : 10.1007/3-540-47867-1_4
, Minimum cost flows over time without intermediate storage, Proceedings of the 35th ACM/SIAM Symp. on Discrete Algorithms (SODA), 2003.
, Efficient continuous-time dynamic network flow algorithms, Operations Research Letters, vol.23, issue.3-5, pp.71-80, 1998.
DOI : 10.1016/S0167-6377(98)00037-6
, Constructing Maximal Dynamic Flows from Static Flows, Operations Research, vol.6, issue.3, pp.419-433, 1958.
DOI : 10.1287/opre.6.3.419
, Transient flows in networks., The Michigan Mathematical Journal, vol.6, issue.1, pp.59-63, 1959.
DOI : 10.1307/mmj/1028998140
, Traffic flow theory: A state-of-the-art report, 1997.
, Optimal dynamic routing in communication networks with continuous traffic. Networks, pp.457-487, 1984.
, Multicommodity Flows over Time: Efficient Algorithms and Complexity, Automata, Languages and Programming, pp.397-409, 2003.
DOI : 10.1007/3-540-45061-0_33
, A generalized dynamic flows problem, Networks, vol.4, issue.2, pp.133-167, 1979.
DOI : 10.1002/net.3230090204
, Polynomial time algorithms for some evacuation problems, Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.433-441, 1994.
, The Quickest Transshipment Problem, Mathematics of Operations Research, vol.25, issue.1, pp.36-62, 2000.
DOI : 10.1287/moor.25.1.36.15211
, Minimum-cost dynamic flows: The series-parallel case, Integer Programming and Combinatorial Optimization, pp.329-343, 1995.
DOI : 10.1002/net.10112
, Time-Expanded Graphs for Flow-Dependent Transit Times, Algorithms -ESA '02, pp.599-611, 2002.
DOI : 10.1007/3-540-45749-6_53
, Flows over Time with Load-Dependent Transit Times, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02), pp.174-183
DOI : 10.1137/S1052623403432645
, Dynamic flows in networks Automation and Remote Control, pp.1417-14347, 1987.
, Maximal, Lexicographic, and Dynamic Network Flows, Operations Research, vol.21, issue.2, pp.517-527, 1973.
DOI : 10.1287/opre.21.2.517
, Dynamic network flows with arc changes. Networks, pp.255-265, 1974.
, An optimal control approach to dynamic routing in networks, IEEE Transactions on Automatic Control, vol.27, issue.2, pp.329-339, 1982.
DOI : 10.1109/TAC.1982.1102915
, Minimum-delay routing in continuous-time dynamic networks with piecewiseconstant capacities. Networks, pp.303-318, 1988.
, On continuous network flows, Operations Research Letters, vol.17, issue.1, pp.27-36, 1995.
DOI : 10.1016/0167-6377(94)00035-5
, Maximum-throughput dynamic network flows, Mathematical Programming, pp.214-231, 1983.
DOI : 10.1007/BF02591946
, Minimum Convex Cost Dynamic Network Flows, Mathematics of Operations Research, vol.9, issue.2, pp.190-207, 1984.
DOI : 10.1287/moor.9.2.190
, Continuous-Time Flows in Networks, Mathematics of Operations Research, vol.15, issue.4, pp.640-661, 1990.
DOI : 10.1287/moor.15.4.640
, An adaptive discretization algorithm for a class of continuous network programs, Networks, vol.31, issue.1, pp.1-11, 1995.
DOI : 10.1002/net.3230260102
, Stochastic and dynamic networks and routing, Handbooks in Operations Research and Management Science ? Network Routings, 1995.
, Optimal Congestion Control in Single Destination Networks, IEEE Transactions on Communications, vol.33, issue.8, pp.792-800, 1985.
DOI : 10.1109/TCOM.1985.1096380
, An Algorithm for Universal Maximal Dynamic Flows in a Network, Operations Research, vol.19, issue.7, pp.1602-1612, 1971.
DOI : 10.1287/opre.19.7.1602
, route des Lucioles -BP 93 -06902 Sophia Antipolis Cedex (France) Unité de recherche INRIA Futurs : Parc Club Orsay Université -ZAC des Vignes 4, 2004.
, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt, Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex
, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399