Pages that link to "Item:Q3465590"

The following pages link to <i>K</i>-Adaptability in Two-Stage Robust Binary Programming (Q3465590):

Displaying 50 items.

• Min-max-min robust combinatorial optimization (Q526823) (← links)
• Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
• Two-stage robust mixed integer programming problem with objective uncertainty (Q723485) (← links)
• An approximation framework for two-stage ambiguous stochastic integer programs under mean-MAD information (Q1634284) (← links)
• Piecewise static policies for two-stage adjustable robust linear optimization (Q1646580) (← links)
• Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty (Q1662157) (← links)
• Binary decision rules for multistage adaptive mixed-integer optimization (Q1702781) (← links)
• Robust combinatorial optimization under budgeted-ellipsoidal uncertainty (Q1731817) (← links)
• A survey of adjustable robust optimization (Q1740490) (← links)
• \(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty (Q1740549) (← links)
• $K$-adaptability in two-stage distributionally robust binary programming (Q1785454) (← links)
• A scenario-based framework for supply planning under uncertainty: stochastic programming versus robust optimization approaches (Q1789611) (← links)
• The decision rule approach to optimization under uncertainty: methodology and applications (Q2010368) (← links)
• Oracle-based algorithms for binary two-stage robust optimization (Q2023665) (← links)
• Exact lexicographic scheduling and approximate rescheduling (Q2029366) (← links)
• Hybrid strategies using linear and piecewise-linear decision rules for multistage adaptive linear optimization (Q2029922) (← links)
• Approximate and robust bounded job start scheduling for Royal Mail delivery offices (Q2061143) (← links)
• \(K\)-adaptability in stochastic optimization (Q2097652) (← links)
• A Lagrangian dual method for two-stage robust optimization with binary uncertainties (Q2101650) (← links)
• An adaptive robust optimization model for parallel machine scheduling (Q2106719) (← links)
• Quantitative stability analysis for minimax distributionally robust risk optimization (Q2118071) (← links)
• Scenario reduction revisited: fundamental limits and guarantees (Q2118076) (← links)
• Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
• Frameworks and results in distributionally robust optimization (Q2165596) (← links)
• Adjustable robust optimization through multi-parametric programming (Q2182773) (← links)
• \(K\)-adaptability in two-stage mixed-integer robust optimization (Q2195680) (← links)
• Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty (Q2197489) (← links)
• Approximations of semicontinuous functions with applications to stochastic optimization and statistical estimation (Q2205979) (← links)
• Robust post-disaster route restoration (Q2215565) (← links)
• Min max min robust (relative) regret combinatorial optimization (Q2216185) (← links)
• Two-stage robust optimization for the orienteering problem with stochastic weights (Q2225187) (← links)
• An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times (Q2239892) (← links)
• Multistage robust mixed-integer optimization under endogenous uncertainty (Q2239983) (← links)
• Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty (Q2312326) (← links)
• Robust and stochastic formulations for ambulance deployment and dispatch (Q2312348) (← links)
• Robust optimization for the vehicle routing problem with multiple deliverymen (Q2323425) (← links)
• A note on \(\Sigma_2^p\)-completeness of a robust binary linear program with binary uncertainty set (Q2661527) (← links)
• On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty (Q2664004) (← links)
• Multistage Robust Mixed-Integer Optimization with Adaptive Partitions (Q2830769) (← links)
• Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set (Q2830957) (← links)
• Optimization under Decision-Dependent Uncertainty (Q4571878) (← links)
• Adjustable Robust Optimization via Fourier–Motzkin Elimination (Q4971396) (← links)
• Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty (Q4994141) (← links)
• Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios (Q4995062) (← links)
• Piecewise Constant Decision Rules via Branch-and-Bound Based Scenario Detection for Integer Adjustable Robust Optimization (Q4995078) (← links)
• On the Optimality of Affine Policies for Budgeted Uncertainty Sets (Q5000650) (← links)
• Technical Note—Two-Stage Sample Robust Optimization (Q5031032) (← links)
• Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective (Q5057987) (← links)
• ROC++: Robust Optimization in C++ (Q5060773) (← links)
• Robust Optimization for Models with Uncertain Second-Order Cone and Semidefinite Programming Constraints (Q5084645) (← links)