Pages that link to "Item:Q1662111"

The following pages link to Robust combinatorial optimization with knapsack uncertainty (Q1662111):

Displaying 16 items.

• Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
• The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach (Q1738828) (← links)
• Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
• The min-p robust optimization approach for facility location problem under uncertainty (Q2165274) (← links)
• Robust combinatorial optimization with locally budgeted uncertainty (Q2165591) (← links)
• Mixed uncertainty sets for robust combinatorial optimization (Q2192978) (← links)
• A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization (Q2197476) (← links)
• Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty (Q2197489) (← links)
• Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty (Q2312326) (← links)
• Proportional and maxmin fairness for the sensor location problem with chance constraints (Q2414477) (← links)
• Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty (Q5003707) (← links)
• Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty (Q5046625) (← links)
• Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions (Q5106418) (← links)
• Robust Optimization with Continuous Decision-Dependent Uncertainty with applications to demand response management (Q6053589) (← links)
• Single machine robust scheduling with budgeted uncertainty (Q6161900) (← links)
• Short paper -- A note on robust combinatorial optimization with generalized interval uncertainty (Q6168886) (← links)