Pages that link to "Item:Q1789596"

The following pages link to Decomposition for adjustable robust linear optimization subject to uncertainty polytope (Q1789596):

Displaying 32 items.

• Robust flows with losses and improvability in evacuation planning (Q339930) (← links)
• Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
• Network design in scarce data environment using moment-based distributionally robust optimization (Q1651520) (← links)
• A perfect information lower bound for robust lot-sizing problems (Q1730584) (← links)
• A survey of adjustable robust optimization (Q1740490) (← links)
• A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation (Q1744909) (← 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)
• A Lagrangian dual method for two-stage robust optimization with binary uncertainties (Q2101650) (← links)
• Multistage adaptive robust optimization for the hydrothermal scheduling problem (Q2108152) (← links)
• Robust inventory theory with perishable products (Q2158637) (← links)
• A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization (Q2191764) (← links)
• \(K\)-adaptability in two-stage mixed-integer robust optimization (Q2195680) (← links)
• Dominance-based linear formulation for the anchor-robust project scheduling problem (Q2239841) (← links)
• Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty (Q2286919) (← links)
• Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective (Q5057987) (← links)
• Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems (Q5058052) (← links)
• Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems (Q5085995) (← links)
• Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions (Q5106418) (← links)
• Robust Dual Dynamic Programming (Q5126635) (← links)
• A Primal–Dual Lifting Scheme for Two-Stage Robust Optimization (Q5131477) (← links)
• Affine routing for robust network design (Q6065910) (← links)
• Adjustable robust optimization with objective uncertainty (Q6069242) (← links)
• The robust cyclic job shop problem (Q6087479) (← links)
• A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty (Q6103748) (← links)
• A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty (Q6130218) (← links)
• An inexact column-and-constraint generation method to solve two-stage robust optimization problems (Q6161289) (← links)
• Minimizing recovery cost of network optimization problems (Q6179707) (← links)
• Value of intermediate imaging in adaptive robust radiotherapy planning to manage radioresistance (Q6601536) (← links)
• Combinatorial robust optimization with decision-dependent information discovery and polyhedral uncertainty (Q6633275) (← links)
• Designing tractable piecewise affine policies for multi-stage adjustable robust optimization (Q6634537) (← links)
• Moment-based distributionally robust joint chance constrained optimization for service network design under demand uncertainty (Q6640180) (← links)