K-adaptability in two-stage robust binary programming
From MaRDI portal
\(K\)-adaptability in two-stage robust binary programming
Recommendations
- $K$-adaptability in two-stage distributionally robust binary programming
- \(K\)-adaptability in two-stage mixed-integer robust optimization
- K-adaptability in stochastic optimization
- Min-max-min robust combinatorial optimization
- \(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty
Cites work
- scientific article; zbMATH DE number 6381764 (Why is no real title available?)
- scientific article; zbMATH DE number 6469210 (Why is no real title available?)
- A geometric characterization of the power of finite adaptability in multistage stochastic and adaptive optimization
- A scenario decomposition algorithm for 0-1 stochastic programs
- Adjustable robust solutions of uncertain linear programs
- An algorithm for the construction of convex hulls in simple integer recourse programming
- An approximation scheme for stochastic linear programming and its application to stochastic integer programs
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- Design of near optimal decision rules in multistage adaptive mixed-integer optimization
- Distributionally robust mixed integer linear programs: persistency models with applications
- Distributionally robust optimization and its tractable approximations
- Dual decomposition in stochastic integer programming
- Finite Adaptability in Multistage Linear Optimization
- Generalized decision rule approximations for stochastic programming via liftings
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty
- Integer Programming and Combinatorial Optimization
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- On optimal allocation of indivisibles under uncertainty
- On the convex hull of the simple integer recourse objective function
- On the power of robust solutions in two-stage stochastic and adaptive optimization problems
- Primal and dual linear decision rules in stochastic and robust optimization
- Risk-averse stochastic optimization: probabilistically-constrained models and algorithms for black-box distributions (extended abstract)
- Robust Combinatorial Optimization with Exponential Scenarios
- Robust software partitioning with multiple instantiation
- Sampling-based approximation algorithms for multistage stochastic optimization
- Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
- Stochastic programming with integer variables
- Supermodularity and affine policies in dynamic robust optimization
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- The robust capacitated vehicle routing problem under demand uncertainty
- The stochastic single resource service-provision problem
- Theory and applications of robust optimization
- Thrifty algorithms for multistage robust optimization
- Two-stage robust network design with exponential scenarios
- Uncertain linear programs: extended affinely adjustable robust counterparts
Cited in
(70)- Approximation guarantees for min-max-min robust optimization and \(k\)-adaptability under objective uncertainty
- Two-stage robust optimization for the orienteering problem with stochastic weights
- A new dual-based cutting plane algorithm for nonlinear adjustable robust optimization
- A survey of adjustable robust optimization
- \(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty
- Adjustable robust optimization via Fourier-Motzkin elimination
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- Optimization under decision-dependent uncertainty
- Adjustable robust optimization through multi-parametric programming
- K-adaptability in stochastic optimization
- \(K\)-adaptability in two-stage mixed-integer robust optimization
- Piecewise Constant Decision Rules via Branch-and-Bound Based Scenario Detection for Integer Adjustable Robust Optimization
- An approximation framework for two-stage ambiguous stochastic integer programs under mean-MAD information
- Oracle-based algorithms for binary two-stage robust optimization
- $K$-adaptability in two-stage distributionally robust binary programming
- A framework for inherently interpretable optimization models
- Approximations of semicontinuous functions with applications to stochastic optimization and statistical estimation
- Piecewise static policies for two-stage adjustable robust linear optimization
- Approximate and robust bounded job start scheduling for Royal Mail delivery offices
- Exact lexicographic scheduling and approximate rescheduling
- Hybrid strategies using linear and piecewise-linear decision rules for multistage adaptive linear optimization
- Multistage robust mixed-integer optimization with adaptive partitions
- Multistage adjustable robust mixed-integer optimization via iterative splitting of the uncertainty set
- On the complexity of robust multi-stage problems with discrete recourse
- Adjustable robust optimization with objective uncertainty
- Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions
- A double-oracle, logic-based Benders decomposition approach to solve the \(K\)-adaptability problem
- Robust integer programming
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty
- Multistage robust discrete optimization via quantified integer programming
- Min-max-min robust combinatorial optimization
- A note on \(\Sigma_2^p\)-completeness of a robust binary linear program with binary uncertainty set
- Robust multiperiod vehicle routing under customer order uncertainty
- On Finite Adaptability in Two-Stage Distributionally Robust Optimization
- Combinatorial robust optimization with decision-dependent information discovery and polyhedral uncertainty
- Adjustability in robust linear optimization
- Designing tractable piecewise affine policies for multi-stage adjustable robust optimization
- A scenario-based framework for supply planning under uncertainty: stochastic programming versus robust optimization approaches
- Robust post-disaster route restoration
- Two-stage robust mixed integer programming problem with objective uncertainty
- ROC++: Robust Optimization in C++
- Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems
- Scenario reduction revisited: fundamental limits and guarantees
- Robust location transportation problems under uncertain demands
- On the optimality of affine policies for budgeted uncertainty sets
- Multistage robust mixed-integer optimization under endogenous uncertainty
- A branch and bound algorithm for robust binary optimization with budget uncertainty
- Robust decision trees for the multi-mode project scheduling problem with a resource investment objective and uncertain activity duration
- A primal-dual lifting scheme for two-stage robust optimization
- Robust and stochastic formulations for ambulance deployment and dispatch
- Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty
- A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty
- An adaptive robust optimization model for parallel machine scheduling
- Robust combinatorial optimization under budgeted-ellipsoidal uncertainty
- Robust Optimization for Models with Uncertain Second-Order Cone and Semidefinite Programming Constraints
- Robust optimization for the vehicle routing problem with multiple deliverymen
- An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times
- Binary decision rules for multistage adaptive mixed-integer optimization
- A geometric characterization of the power of finite adaptability in multistage stochastic and adaptive optimization
- Technical note -- two-stage sample robust optimization
- The decision rule approach to optimization under uncertainty: methodology and applications
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Quantitative stability analysis for minimax distributionally robust risk optimization
- Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
- Min max min robust (relative) regret combinatorial optimization
- Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios
- Frameworks and results in distributionally robust optimization
- A Lagrangian dual method for two-stage robust optimization with binary uncertainties
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty
- Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
This page was built for publication: \(K\)-adaptability in two-stage robust binary programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3465590)
