Pages that link to "Item:Q486397"

The following pages link to An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397):

Displaying 3 items.

• A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
• Formulation and algorithms for the robust maximal covering location problem (Q1742214) (← links)
• A utility theory based interactive approach to robustness in linear optimization (Q1753136) (← links)