A generalized upper bounding algorithm for multicommodity network flow problems
From MaRDI portal
Publication:5668604
DOI10.1002/net.3230010404zbMath0253.90030MaRDI QIDQ5668604
Publication date: 1972
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230010404
Related Items
Basis characterisation for linear multicommodity network programs, Unnamed Item, Unnamed Item, Some problems in discrete optimization, A partitioning algorithm for the multicommodity network flow problem, Tree network design avoiding congestion, The basis suppression method, The multicommodity assignment problem: A network aggregation heuristic, \({\mathcal H}_ 2\) guaranteed cost control for uncertain continuous-time linear systems, Extreme points and adjacency relationship in the flow polytope, Dynamic factorization in large-scale optimization, Multicommodity network flow with jump constraints, A decomposition-based approach for the multiperiod multiproduct distribution planning problem, Large-scale linear programming: Geometry, working bases and factorizations
Cites Work