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

DOI10.1287/opre.41.4.669zbMath0782.90032OpenAlexW2079465291WikidataQ60140236 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 flowdual network simplex methodprimal partitioning and decomposition

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

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

Uses Software

• KORBX
• MINOS