Pages that link to "Item:Q1698883"

The following pages link to Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (Q1698883):

Displaying 7 items.

• Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
• Variable-sized uncertainty and inverse problems in robust optimization (Q1694311) (← links)
• Project net present value estimation under uncertainty (Q1725833) (← links)
• Compromise solutions for robust combinatorial optimization with variable-sized uncertainty (Q1750469) (← links)
• The impacts of retailers' regret aversion on a random multi-period supply chain network (Q2086940) (← links)
• On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty (Q2664004) (← links)
• Combinatorial optimization problems with balanced regret (Q2685694) (← links)