Basis characterisation for linear multicommodity network programs

DOI10.1080/02331939508844087zbMATH Open0821.90132OpenAlexW2061930918MaRDI QIDQ4836775FDOQ4836775

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

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

zbMATH Keywords

hypergraphslinear multicommodity network programs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A Survey of Linear Cost Multicommodity Network Flows
• Title not available (Why is that?)
• Multicommodity network flows—A survey
• Title not available (Why is that?)
• A generalized upper bounding algorithm for multicommodity network flow problems
• A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem

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)