A linear model for compound multicommodity network flow problems
From MaRDI portal
Publication:2654399
DOI10.1016/j.cor.2009.09.012zbMath1178.90248OpenAlexW2026058090MaRDI QIDQ2654399
Catia M. S. Machado, Sérgio F. Mayerle, Vilmar Trevisan
Publication date: 15 January 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.09.012
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- An implementation of linear and nonlinear multicommodity network flows
- Using an interior point method for the master problem in a decomposition approach
- Solving difficult multicommodity problems with a specialized interior-point algorithm
- An augmented Lagrangian algorithm for large scale multicommodity routing
- A primal partitioning approach for single and non-simultaneous multicommodity flow problems
- A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem
- Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems
- An efficient implementation of the network simplex method
- Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
- A product form representation of the inverse of a multicommodity cycle matrix
- Solving multicommodity transportation problems using a primal partitioning simplex technique
- A Survey of Linear Cost Multicommodity Network Flows
- A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
- A Specialized Interior-Point Algorithm for Multicommodity Network Flows
- A partitioning algorithm for the multicommodity network flow problem
This page was built for publication: A linear model for compound multicommodity network flow problems
