Basis characterisation for linear multicommodity network programs

DOI10.1080/02331939508844087MaRDI QIDQ4836775zbMATH OpenOpenAlexFDO

Authors Malcolm C. Pullan

Publication date 21 June 1995

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331939508844087

zbMATH Keywords

hypergraphslinear multicommodity network programs

Mathematics Subject Classification ID

Linear programming (90C05) Programming involving graphs or networks (90C35)

Recommendations

• New methods for multi-commodity flows
• Solution Bases of Multiterminal Cut Problems
• Advanced start for the multicommodity network flow problem
• The simplex algorithm for multicommodity networks
• Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3961334 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3791941 (Why is no real title available?)
• A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
• A Survey of Linear Cost Multicommodity Network Flows
• A generalized upper bounding algorithm for multicommodity network flow problems
• Multicommodity network flows—A survey

Cited in

(1)

• The simplex algorithm for multicommodity networks

This page was built for publication: Basis characterisation for linear multicommodity network programs

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