Pages that link to "Item:Q1599297"
From MaRDI portal
The following pages link to Discrete cost multicommodity network optimization problems and exact solution methods (Q1599297):
Displaying 15 items.
- Chance-constrained problems and rare events: an importance sampling approach (Q291054) (← links)
- Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard (Q968181) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Heterogeneous flow distribution at the peak load in the multiuser network (Q2171298) (← links)
- The multi-layered network design problem (Q2370332) (← links)
- Speed-up Benders decomposition using maximum density cut (MDC) generation (Q2442077) (← links)
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions (Q2442081) (← links)
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements (Q2468776) (← links)
- Optimal solution of the discrete cost multicommodity network design problem (Q2518654) (← links)
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design (Q3183450) (← links)
- APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN (Q3224959) (← links)
- Accelerating Benders method using covering cut bundle generation (Q3563624) (← links)
- Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems (Q4637497) (← links)
- An exact approach for the multicommodity network optimization problem with a step cost function (Q5244303) (← links)
