Fetching the paper…
Reading the bibliography…
In this work, we develop a new framework for dynamic network flow problems based on optimal transport theory.
1910
Earlier work this paper cites.
Ford LR, Fulkerson DR (1962) Flows in networks (Princeton university press)
1962
Earlier work this paper cites.
Karlsson J, Ringh A (2017) Generalized Sinkhorn iterations for regularizing inverse problems using optimal mass transport. SIAM Journal on Imaging Sciences 10(4):1935–1962
1962
Earlier work this paper cites.
Tomlin JA (1966) Minimum-cost multicommodity network flows. Operations Research 14(1):45–51
1966
Earlier work this paper cites.
Kennington J, Shalaby M (1977) An effective subgradient procedure for minimal cost multicommodity flow problems. Management Science 23(9):994–1004
1977
Earlier work this paper cites.
Kennington JL (1978) A survey of linear cost multicommodity network flows. Operations Research 26(2):209–236
1978
Earlier work this paper cites.
Bertsekas DP, Tseng P (1988) Relaxation methods for minimum cost ordinary and generalized network flow problems. Operations Research 36(1):93–114
1988
Earlier work this paper cites.
Aronson J (1989) A survey of dynamic network flows. Annals of Operations Research 20(1):1–66
1989
Earlier work this paper cites.
Tseng P (1990) Dual ascent methods for problems with strictly convex costs and linear constraints: A unified approach. SIAM Journal on Control and Optimization 28(1):214–242
1990
Earlier work this paper cites.
Luo ZQ, Tseng P (1992) On the convergence of the coordinate descent method for convex differentiable minimization. Journal of Optimization Theory and Applications 72(1):7–35
1992
Earlier work this paper cites.
Farvolden JM, Powell WB, Lustig IJ (1993) A primal partitioning solution for the arc-chain formulation of a multicommodity network flow problem. Operations Research 41(4):669–693
1993
Earlier work this paper cites.
Jones K, Lustig I, Farvolden J, Powell W (1993) Multicommodity network flows: The impact of formulation on decomposition. Mathematical Programming 62(1-3):95–117
1993
Earlier work this paper cites.
Rüschendorf L (1995) Optimal solutions of multivariate coupling problems. Applicationes Mathematicae 23(3):325–338
1995
Earlier work this paper cites.
Haghani A, Oh SC (1996) Formulation and solution of a multi-commodity, multi-modal network flow model for disaster relief operations. Transportation Research Part A: Policy and Practice 30(3):231–250
1996
Earlier work this paper cites.
1996
Earlier work this paper cites.
Gangbo W, Świech A (1998) Optimal maps for the multidimensional Monge-Kantorovich problem. Comm. on Pure and Appl. Math.: Courant Inst. of Math. Sci. 51(1):23–45
1998
Earlier work this paper cites.
McBride R (1998) Progress made in solving the multicommodity flow problem. SIAM Journal on Optimization 8(4):947–955
1998
Earlier work this paper cites.
Gendron B, Crainic TG, Frangioni A (1999) Multicommodity capacitated network design. Telecommunications network planning , 1–19 (Springer)
1999
Earlier work this paper cites.
Bauschke H, Lewis A (2000) Dykstras algorithm with Bregman projections: A convergence proof. Optimization 48(4):409–427
2000
Cited alongside, same era.
Benamou JD, Brenier Y (2000) A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem. Numerische Mathematik 84(3):375–393
2000
Cited alongside, same era.
Bertsimas D, Patterson SS (2000) The traffic flow management rerouting problem in air traffic control: A dynamic network flow approach. Transportation Science 34(3):239–255
2000
Cited alongside, same era.
Rüschendorf L, Uckelmann L (2002) On the n-coupling problem. Journal of multivariate analysis 81(2):242–258
2002
Cited alongside, same era.
Benamou JD, Brenier Y, Guittet K (2004) Numerical analysis of a multi-phasic mass transport problem. Contemporary Mathematics 353:1–18
2004
Cited alongside, same era.
Léonard C (2014) A survey of the Schrödinger problem and some of its connections with optimal transport. Discrete & Continuous Dynamical Systems - A 34(4):1533–1574
2014
Later among the works it cites.
Benamou JD, Carlier G, Cuturi M, Nenna L, Peyré G (2015) Iterative Bregman projections for regularized transportation problems. SIAM Journal on Scientific Computing 37(2):A1111–A1138
2015
Later among the works it cites.
Pass B (2015) Multi-marginal optimal transport: theory and applications. ESAIM: Mathematical Modelling and Numerical Analysis 49(6):1771–1790
2015
Later among the works it cites.
Nenna L (2016) Numerical methods for multi-marginal optimal transportation . Ph.D. thesis, PSL
2016
Later among the works it cites.
Chen Y, Georgiou TT, Pavon M, Tannenbaum A (2017) Efficient robust routing for single commodity network flows. IEEE Transactions on Automatic Control 63(7):2287–2294
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Boyd S, Vandenberghe L (2004) Convex optimization (Cambridge university press)
2004
Cited alongside, same era.
2004
Cited alongside, same era.
Retvdri G, Bíró J, Cinkler T (2004) A novel lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to ospf traffic engineering. Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No. 04TH8769) , volume 2, 957–962 (IEEE)
2004
Cited alongside, same era.
2006
Cited alongside, same era.
Hall A, Hippler S, Skutella M (2007) Multicommodity flows over time: Efficient algorithms and complexity. Theoretical Computer Science 379(3):387–404
2007
Cited alongside, same era.
2008
Cited alongside, same era.
Villani C (2008) Optimal transport: Old and new (Berlin Heidelberg: Springer)
2008
Cited alongside, same era.
2017
Later among the works it cites.
Diestel R (2017) Graph Theory (Berlin, Heidelberg: Springer)
2017
Later among the works it cites.
Chen Y, Georgiou TT, Tannenbaum A (2018) Vector-valued optimal mass transport. SIAM Journal on Applied Mathematics 78(3):1682–1696
2018
Later among the works it cites.
Wang IL (2018) Multicommodity network flows: A survey, Part I: Applications and Formulations. International Journal of Operations Research 15(4):145–153
2018
Later among the works it cites.
Chen Y, Georgiou TT, Pavon M, Tannenbaum A (2019) Relaxed Schrödinger bridges and robust network routing. IEEE Transactions on Control of Network Systems 7(2):923–931
2019
Later among the works it cites.
Haasler I, Ringh A, Chen Y, Karlsson J (2019) Estimating ensemble flows on a hidden Markov chain. 2019 IEEE 58th Conference on Decision and Control (CDC) , 1331–1338 (IEEE)
2019
Later among the works it cites.
IBM: ILOG CPLEX (2019) Optimization Studio 12.10.0: CP Optimizer Online Documentation. URL https://www.ibm.com/docs/en/icos/12.10.0
2019
Later among the works it cites.
Khodayifar S (2019) Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle. Optimization Letters 1–18
2019
Later among the works it cites.
Pasquale C, Sacone S, Siri S, Ferrara A (2019) Traffic control for freeway networks with sustainability-related objectives: Review and future challenges. Annual Reviews in Control 48:312–324
2019
Later among the works it cites.
Peyré G, Cuturi M (2019) Computational optimal transport. Foundations and Trends® in Machine Learning 11(5-6):355–607
2019
Later among the works it cites.
Bacon X (2020) Multi-species optimal transportation. Journal of Optimization Theory and Applications 184(2):315–337
2020
Later among the works it cites.
Elvander F, Haasler I, Jakobsson A, Karlsson J (2020) Multi-marginal optimal mass transport using partial information with applications in robust localization and sensor fusion. Signal Processing 171:107474
2020
Later among the works it cites.
Lin T, Ho N, Chen X, Cuturi M, Jordan M (2020) Fixed-support Wasserstein barycenters: Computational hardness and fast algorithm. Larochelle H, Ranzato M, Hadsell R, Balcan MF, Lin H, eds., Advances in Neural Information Processing Systems , volume 33, 5368–5380 (Curran Associates, Inc.)
2020
Later among the works it cites.