Solving multicommodity transportation problems using a primal partitioning simplex technique

DOI10.1002/NAV.3800240210MaRDI QIDQ4154390zbMATH OpenOpenAlexFDO

Authors Jeffery L. Kennington

Publication date 1977

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800240210

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Operations research and management science (90B99) Linear programming (90C05) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Cites work

• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm

Cited in

(5)

• Dynamic factorization in large-scale optimization
• An algorithm to evaluate the system reliability for multicommodity case under cost constraint
• A linear model for compound multicommodity network flow problems
• A product form representation of the inverse of a multicommodity cycle matrix
• Multicommodity network flows: A survey. II: Solution methods

This page was built for publication: Solving multicommodity transportation problems using a primal partitioning simplex technique

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