A linear model for compound multicommodity network flow problems

DOI10.1016/J.COR.2009.09.012MaRDI QIDQ2654399zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

compound multicommoditieslinear programmingpartitioning

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• A composite algorithm for a concave-cost network flow problem
• An implementation of linear and nonlinear multicommodity network flows
• Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
• A combined matheuristic for the piecewise linear multicommodity network flow problem
• scientific article; zbMATH DE number 1217674

Cites work

• A decomposition-based pricing procedure for large-scale linear programs: an application to the linear multicommodity flow problem
• A new polynomial-time algorithm for linear programming
• A partitioning algorithm for the multicommodity network flow problem
• A primal partitioning approach for single and non-simultaneous multicommodity flow problems
• A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
• A product form representation of the inverse of a multicommodity cycle matrix
• A Specialized Interior-Point Algorithm for Multicommodity Network Flows
• A Survey of Linear Cost Multicommodity Network Flows
• An augmented Lagrangian algorithm for large scale multicommodity routing
• An efficient implementation of the network simplex method
• An implementation of linear and nonlinear multicommodity network flows
• scientific article; zbMATH DE number 3791941 (Why is no real title available?)
• scientific article; zbMATH DE number 1070392 (Why is no real title available?)
• scientific article; zbMATH DE number 2080144 (Why is no real title available?)
• Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems
• Solving difficult multicommodity problems with a specialized interior-point algorithm
• Solving multicommodity transportation problems using a primal partitioning simplex technique
• Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
• Using an interior point method for the master problem in a decomposition approach

Cited in

(1)

• Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité

Describes a project that uses

Uses Software

• PPRN
• IPM

This page was built for publication: A linear model for compound multicommodity network flow problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2654399)