The multicommodity assignment problem: A network aggregation heuristic
From MaRDI portal
Publication:1147630
DOI10.1016/0898-1221(81)90118-8zbMath0449.90065MaRDI QIDQ1147630
Publication date: 1980
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(81)90118-8
computational experience; large 0-1 integer programming problems; multicommodity assignment problem; network aggregation heuristic; node- aggregation
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90C06: Large-scale problems in mathematical programming
90C09: Boolean programming
Related Items
A survey of dynamic network flows, The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Bounds for Row-Aggregation in Linear Programming
- Bounds for aggregating nodes in network problems
- Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
- Unimodular matrices of flow problems with additional constraints
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Graphic matroids and the multicommodity transportation problem
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- Integral Extreme Points
- Letter to the Editor—The Multidimensional Assignment Problem
- Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows
- A generalized upper bounding algorithm for multicommodity network flow problems
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
