A robust optimization model for distribution network design under a mixed integer set of scenarios
From MaRDI portal
Publication:2669596
Recommendations
- A robust optimization model for a supply chain under uncertainty
- A robustness approach to uncapacitated network design problems
- Technical note: Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations
- Network design in scarce data environment using moment-based distributionally robust optimization
- The design of robust value-creating supply chain networks
Cites work
- A branch-and-cut algorithm for capacitated network design problems
- A characterization of the uncapacitated network design polytope
- A minmax regret version of the time-dependent shortest path problem
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- A polyhedral analysis of the capacitated edge activation problem with uncertain demands
- A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks
- A robustness approach to uncapacitated network design problems
- A survey on Benders decomposition applied to fixed-charge network design problems
- Algorithms for robust single and multiple period layout planning for manufacturing systems
- An exact algorithm for robust network design
- Benders decomposition approach for the robust network design problem with flow bifurcations
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition
- Interval data minmax regret network optimization problems
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Network Design Using Cut Inequalities
- On a constant factor approximation for minmax regret problems using a symmetry point scenario
- On capacitated network design cut-set polyhedra
- On cut-based inequalities for capacitated network design polyhedra
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- Provisioning virtual private networks under traffic uncertainty
- Robust and reliable forward-reverse logistics network design under demand uncertainty and facility disruptions
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Robust flows over time: models and complexity results
- Robust linear optimization under general norms.
- Robust network design: formulations, valid inequalities, and computations
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
- Robust supply chain design under uncertain demand in agile manufacturing
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Shortest paths algorithms: Theory and experimental evaluation
- Supply chain network design under uncertainty: a comprehensive review and future research directions
- The Price of Robustness
- The computational complexity of the relative robust shortest path problem with interval data
Cited in
(2)
This page was built for publication: A robust optimization model for distribution network design under a mixed integer set of scenarios
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669596)
