Pages that link to "Item:Q1652219"

The following pages link to A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219):

Displaying 12 items.

• The robust set covering problem with interval data (Q367647) (← links)
• Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) (← links)
• The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← links)
• Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem'' (Q1675565) (← links)
• A double oracle approach to minmax regret optimization problems with interval data (Q1683128) (← links)
• A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
• Robust min-max regret covering problems (Q2162527) (← links)
• Minmax regret maximal covering location problems with edge demands (Q2668649) (← links)
• Logic-Based Benders Decomposition for Large-Scale Optimization (Q3296379) (← links)
• Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem (Q3466782) (← links)
• A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)
• Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty (Q6186579) (← links)