Pages that link to "Item:Q1942010"

The following pages link to Robust combinatorial optimization with variable budgeted uncertainty (Q1942010):

Displaying 32 items.

• Robust combinatorial optimization with variable cost uncertainty (Q296586) (← links)
• Adjustable robustness for multi-attribute project portfolio selection (Q323007) (← links)
• Exact solution of the robust knapsack problem (Q336592) (← links)
• The robust knapsack problem with queries (Q337391) (← links)
• Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
• Robust combinatorial optimization with knapsack uncertainty (Q1662111) (← links)
• Variable-sized uncertainty and inverse problems in robust optimization (Q1694311) (← links)
• A perfect information lower bound for robust lot-sizing problems (Q1730584) (← links)
• Robust combinatorial optimization under budgeted-ellipsoidal uncertainty (Q1731817) (← links)
• The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach (Q1738828) (← links)
• Minimizing the weighted sum of completion times under processing time uncertainty (Q1742192) (← links)
• Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets (Q2097674) (← links)
• Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty (Q2106728) (← links)
• A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system (Q2160517) (← links)
• Robust combinatorial optimization with locally budgeted uncertainty (Q2165591) (← links)
• Generalized hose uncertainty in single-commodity robust network design (Q2182776) (← links)
• Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty (Q2197489) (← links)
• Distributionally robust optimization with decision dependent ambiguity sets (Q2228422) (← links)
• Robust scheduling with budgeted uncertainty (Q2414457) (← links)
• Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen (Q2664412) (← links)
• A Dynamic Programming Approach for a Class of Robust Optimization Problems (Q2817842) (← links)
• Robust Network Design with Uncertain Outsourcing Cost (Q3458750) (← links)
• Optimization under Decision-Dependent Uncertainty (Q4571878) (← links)
• Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty (Q5003707) (← links)
• Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback (Q5868922) (← links)
• Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations (Q5970783) (← links)
• Robust Optimization with Continuous Decision-Dependent Uncertainty with applications to demand response management (Q6053589) (← links)
• A generalized robust data envelopment analysis model based on directional distance function (Q6096583) (← links)
• A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty (Q6130218) (← links)
• A robust model for the lot-sizing problem with uncertain demands (Q6166060) (← links)
• Robust data envelopment analysis with variable budgeted uncertainty (Q6554664) (← links)
• Combinatorial robust optimization with decision-dependent information discovery and polyhedral uncertainty (Q6633275) (← links)