Adjustable robust optimization with objective uncertainty

Cites Work

Unnamed Item
Unnamed Item
Benders decomposition without separability: a computational study for capacitated facility location problems
Robust location transportation problems under uncertain demands
A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
A comparison of heuristics and relaxations for the capacitated plant location problem
Min-max and min-max regret versions of combinatorial optimization problems: A survey
Adjustable robust solutions of uncertain linear programs
A survey of adjustable robust optimization
Decomposition for adjustable robust linear optimization subject to uncertainty polytope
Convex programming for disjunctive convex optimization
A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables
Oracle-based algorithms for binary two-stage robust optimization
\(K\)-adaptability in two-stage mixed-integer robust optimization
Solving two-stage robust optimization problems using a column-and-constraint generation method
On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
Two-stage network constrained robust unit commitment problem
Generalized Disjunctive Programming: A Framework for Formulation and Alternative Algorithms for MINLP Optimization
Theory and Applications of Robust Optimization
K-Adaptability in Two-Stage Robust Binary Programming
The Price of Robustness
The congested facility location problem
Finite Adaptability in Multistage Linear Optimization
Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems
Convex Analysis
Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
A survey of nonlinear robust optimization

This page was built for publication: Adjustable robust optimization with objective uncertainty