Discrete cost multicommodity network optimization problems and exact solution methods
From MaRDI portal
Publication:1599297
DOI10.1023/A:1014554606793zbMath1015.90013MaRDI QIDQ1599297
Publication date: 9 June 2002
Published in: Annals of Operations Research (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
Related Items
Chance-constrained problems and rare events: an importance sampling approach, Adaptive memory in multistart heuristics for multicommodity network design, Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard, Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation, The multi-layered network design problem, Speed-up Benders decomposition using maximum density cut (MDC) generation, An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions, Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements, Optimal solution of the discrete cost multicommodity network design problem, Approximation Algorithms for Buy-at-Bulk Geometric Network Design, APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN, Accelerating Benders method using covering cut bundle generation
