Algorithms for multiplayer multicommodity flow problems
From MaRDI portal
Publication:301120
DOI10.1007/s10100-012-0255-6zbMath1339.90076OpenAlexW2086271343MaRDI QIDQ301120
Tamás Király, Jácint Szabó, Gergely Mádi-Nagy, Attila Bernáth, Júlia Pap, Gyula Pap, László A. Végh, Erika R. Bérczi-Kovács
Publication date: 29 June 2016
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/19435/1/egres_12_09_u_163950.709907.pdf
Related Items
Cites Work
- Unnamed Item
- Mechanism design for a multicommodity flow game in service network alliances
- A generalization of Brouwer's fixed point theorem
- A Suggested Computation for Maximal Multi-Commodity Network Flows
- Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- A simple method for improving the primal simplex method for the multicommodity flow problem