A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem

DOI10.1287/opre.41.4.669zbMath0782.90032WikidataQ60140236 ScholiaQ60140236MaRDI QIDQ4272892

Warren B. Powell, Irvin J. Lustig, Judith M. Farvolden

Publication date: 28 February 1994

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.41.4.669

zbMATH Keywords

multicommodity network flow; dual network simplex method; primal partitioning and decomposition

Mathematics Subject Classification ID

90B10: Deterministic network models in operations research

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Basis characterisation for linear multicommodity network programs, Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité, A metaheuristic for stochastic service network design, A capacity scaling heuristic for the multicommodity capacitated network design problem, Multicommodity network flows: The impact of formulation on decomposition, Multicommodity network flow with jump constraints, Solving nonlinear multicommodity flow problems by the analytic center cutting plane method, Quadratic resource allocation with generalized upper bounds, A primal partitioning approach for single and non-simultaneous multicommodity flow problems, Service network design in freight transportation, Service network design for freight transportation: a review, A linear model for compound multicommodity network flow problems

Uses Software

• KORBX
• MINOS