Pages that link to "Item:Q2817842"

The following pages link to A Dynamic Programming Approach for a Class of Robust Optimization Problems (Q2817842):

Displaying 13 items.

• A perfect information lower bound for robust lot-sizing problems (Q1730584) (← links)
• The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach (Q1738828) (← links)
• Robust formulations for economic lot-sizing problem with remanufacturing (Q2028886) (← links)
• Robust inventory problem with budgeted cumulative demand uncertainty (Q2091209) (← links)
• Robust optimization for lot-sizing problems under yield uncertainty (Q2108119) (← links)
• Dynamic lot sizing with stochastic demand timing (Q2140333) (← links)
• Robust inventory theory with perishable products (Q2158637) (← links)
• A survey of decision making and optimization under uncertainty (Q2241216) (← links)
• Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty (Q2286919) (← links)
• Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem (Q4995096) (← links)
• Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions (Q5106418) (← links)
• Comparison of different approaches to multistage lot sizing with uncertain demand (Q6080612) (← links)
• A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty (Q6130218) (← links)