A robust optimization model for distribution network design under a mixed integer set of scenarios
From MaRDI portal
Publication:2669596
DOI10.1016/j.cor.2021.105493OpenAlexW3188962417MaRDI QIDQ2669596
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105493
Cites Work
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition
- A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks
- On a constant factor approximation for minmax regret problems using a symmetry point scenario
- The computational complexity of the relative robust shortest path problem with interval data
- Robust linear optimization under general norms.
- A minmax regret version of the time-dependent shortest path problem
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Robust supply chain design under uncertain demand in agile manufacturing
- A characterization of the uncapacitated network design polytope
- Algorithms for robust single and multiple period layout planning for manufacturing systems
- A robustness approach to uncapacitated network design problems
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- Robust and reliable forward-reverse logistics network design under demand uncertainty and facility disruptions
- Supply chain network design under uncertainty: a comprehensive review and future research directions
- A survey on Benders decomposition applied to fixed-charge network design problems
- Robust flows over time: models and complexity results
- A branch-and-cut algorithm for capacitated network design problems
- Interval data minmax regret network optimization problems
- On capacitated network design cut-set polyhedra
- Shortest paths algorithms: Theory and experimental evaluation
- On cut-based inequalities for capacitated network design polyhedra
- An Exact Algorithm for Robust Network Design
- Provisioning virtual private networks under traffic uncertainty
- The Price of Robustness
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Network Design Using Cut Inequalities
- A polyhedral analysis of the capacitated edge activation problem with uncertain demands
- Robust network design: Formulations, valid inequalities, and computations
- Benders decomposition approach for the robust network design problem with flow bifurcations
This page was built for publication: A robust optimization model for distribution network design under a mixed integer set of scenarios
