The multicommodity assignment problem: A network aggregation heuristic

DOI10.1016/0898-1221(81)90118-8zbMath0449.90065OpenAlexW2014406724MaRDI QIDQ1147630

James R. Evans

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

zbMATH Keywords

computational experiencelarge 0-1 integer programming problemsmulticommodity assignment problemnetwork aggregation heuristicnode- aggregation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Boolean programming (90C09)

Related Items (3)

A survey of dynamic network flows ⋮ Unnamed Item ⋮ 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

This page was built for publication: The multicommodity assignment problem: A network aggregation heuristic