A generalized upper bounding algorithm for multicommodity network flow problems

DOI10.1002/NET.3230010404zbMath0253.90030OpenAlexW2024684012MaRDI QIDQ5668604

J. K. Hartman, L. S. 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

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

Related Items (14)

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

Cites Work

• Unnamed Item

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