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):

Displayed 8 items.

• A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) ‎ (← links)
• Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem'' (Q1675565) ‎ (← 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)
• Robust min-max regret covering problems (Q2162527) ‎ (← links)
• Algorithms for the minmax regret path problem with interval data (Q2198244) ‎ (← links)
• On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs (Q2835657) ‎ (← links)
• A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) ‎ (← links)