A Lagrangian dual method for two-stage robust optimization with binary uncertainties
From MaRDI portal
Publication:2101650
DOI10.1007/s11081-022-09710-xzbMath1499.90269arXiv2112.13138OpenAlexW4220937575MaRDI QIDQ2101650
Publication date: 6 December 2022
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.13138
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Min-max-min robust combinatorial optimization
- Robust optimization - a comprehensive survey
- Robust discrete optimization and its applications
- Adjustable robust solutions of uncertain linear programs
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- Robust ranking and portfolio optimization
- The decision rule approach to optimization under uncertainty: methodology and applications
- Oracle-based algorithms for binary two-stage robust optimization
- \(K\)-adaptability in two-stage mixed-integer robust optimization
- Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
- Recent advances in robust optimization: an overview
- Designing networks with resiliency to edge failures using two-stage robust optimization
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Multistage Robust Mixed-Integer Optimization with Adaptive Partitions
- Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set
- A Distributional Interpretation of Robust Optimization
- The $N-k$ Problem in Power Grids: New Models, Formulations, and Numerical Experiments
- Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts
- Robust Quadratic Programming with Mixed-Integer Uncertainty
- Managing Supply in the On-Demand Economy: Flexible Workers, Full-Time Employees, or Both?
- Design of Near Optimal Decision Rules in Multistage Adaptive Mixed-Integer Optimization
- K-Adaptability in Two-Stage Robust Binary Programming
- The Price of Robustness
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations
- Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls
- Adjustable Robust Optimization via Fourier–Motzkin Elimination
- Finite Adaptability in Multistage Linear Optimization
- Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty
- Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios
- Linearized Robust Counterparts of Two-Stage Robust Optimization Problems with Applications in Operations Management
- Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems
- Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands
- Design of Survivable Networks: A survey
- Robust network design: Formulations, valid inequalities, and computations
- JuMP: A Modeling Language for Mathematical Optimization
This page was built for publication: A Lagrangian dual method for two-stage robust optimization with binary uncertainties
