Pages that link to "Item:Q1634058"

The following pages link to Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios (Q1634058):

Displaying 3 items.

• Robust optimization strategies for seller based on uncertainty sets in context of sequential auction (Q2660835) (← links)
• Minmax regret maximal covering location problems with edge demands (Q2668649) (← links)
• Combinatorial optimization problems with balanced regret (Q2685694) (← links)