Basis characterisation for linear multicommodity network programs

DOI10.1080/02331939508844087zbMath0821.90132OpenAlexW2061930918MaRDI QIDQ4836775

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

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

Related Items (1)

The simplex algorithm for multicommodity networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Survey of Linear Cost Multicommodity Network Flows
• Multicommodity network flows—A survey
• A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
• A generalized upper bounding algorithm for multicommodity network flow problems

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