A generalized upper bounding algorithm for multicommodity network flow problems

DOI10.1002/NET.3230010404MaRDI QIDQ5668604zbMATH OpenOpenAlexFDO

Authors J. K. Hartman, Leon Lasdon

Publication date 1972

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230010404

Mathematics Subject Classification ID

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

Cited in

(14)

• Large-scale linear programming: Geometry, working bases and factorizations
• Multicommodity network flows: a survey. I: Applications and formulations
• Multicommodity network flows: A survey. II: Solution methods
• A partitioning algorithm for the multicommodity network flow problem
• \({\mathcal H}_ 2\) guaranteed cost control for uncertain continuous-time linear systems
• Some problems in discrete optimization
• Dynamic factorization in large-scale optimization
• A decomposition-based approach for the multiperiod multiproduct distribution planning problem
• Extreme points and adjacency relationship in the flow polytope
• Basis characterisation for linear multicommodity network programs
• Tree network design avoiding congestion
• The basis suppression method
• The multicommodity assignment problem: A network aggregation heuristic
• Multicommodity network flow with jump constraints

This page was built for publication: A generalized upper bounding algorithm for multicommodity network flow problems

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