A robust optimization model for distribution network design under a mixed integer set of scenarios

Cites Work

The Price of Robustness
Robust discrete optimization and its applications
Robust discrete optimization and network flows
On splittable and unsplittable flow capacitated network design arc-set polyhedra.
Robust linear optimization under general norms.
Min-max and min-max regret versions of combinatorial optimization problems: A survey
Interval data minmax regret network optimization problems
On capacitated network design cut-set polyhedra
On cut-based inequalities for capacitated network design polyhedra
An Exact Algorithm for Robust Network Design
Provisioning virtual private networks under traffic uncertainty
Network Design Using Cut Inequalities
Robust network design: Formulations, valid inequalities, and computations
Robust supply chain design under uncertain demand in agile manufacturing
A survey on Benders decomposition applied to fixed-charge network design problems
A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
On a constant factor approximation for minmax regret problems using a symmetry point scenario
A characterization of the uncapacitated network design polytope
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
Shortest paths algorithms: Theory and experimental evaluation
Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
The computational complexity of the relative robust shortest path problem with interval data
Discrete optimization with interval data. Minmax regret and fuzzy approach
A branch-and-cut algorithm for capacitated network design problems
Send-and-Split Method for Minimum-Concave-Cost Network Flows
Robust and reliable forward-reverse logistics network design under demand uncertainty and facility disruptions
Algorithms for robust single and multiple period layout planning for manufacturing systems
A robustness approach to uncapacitated network design problems
A minmax regret version of the time-dependent shortest path problem
Supply chain network design under uncertainty: a comprehensive review and future research directions
Benders decomposition approach for the robust network design problem with flow bifurcations
Robust flows over time: models and complexity results
A polyhedral analysis of the capacitated edge activation problem with uncertain demands

Cited In (2)

An adaptive multi-objective optimization method for optimum design of distribution networks
Distribution network design: New problems and related models

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)