Pages that link to "Item:Q2835657"

The following pages link to On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs (Q2835657):

Displayed 4 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)
• Logic-Based Benders Decomposition for Large-Scale Optimization (Q3296379) ‎ (← links)
• Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty (Q6186579) ‎ (← links)