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