Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty

DOI10.1051/ro/2022198OpenAlexW4308589043MaRDI QIDQ6186579

Christophe Duhamel, Thiago F. Noronha, Iago A. Carvalho

Publication date: 2 February 2024

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2022198

zbMATH Keywords

metaheuristicsinterval uncertaintybinary integer programmingfix-and-optimizeMinmax Regret

Mathematics Subject Classification ID

General topics of discrete mathematics in relation to computer science (68R01) Mixed integer programming (90C11) Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59) Robustness in mathematical programming (90C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fix-and-optimize heuristic for the high school timetabling problem
• Pinpointing the complexity of the interval min-max regret knapsack problem
• Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions
• Complexity of the min-max and min-max regret assignment problems
• A branch and bound algorithm for the minimax regret spanning arborescence
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• Partitioning procedures for solving mixed-variables programming problems
• On integer points in polyhedra
• The polynomial-time hierarchy
• Robust discrete optimization and its applications
• Robust solutions of linear programming problems contaminated with uncertain data
• Mixed integer programming based heuristics for the patient admission scheduling problem
• A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
• On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions
• Formulation and algorithms for the robust maximal covering location problem
• Complexity of robust single facility location problems on networks with uncertain edge lengths.
• Interval data minmax regret network optimization problems
• On the complexity of minmax regret linear programming
• Min-max and min-max (relative) regret approaches to representatives selection problem
• Complexity of the robust weighted independent set problems on interval graphs
• Complexity of minimizing the total flow time with interval data and minmax regret criterion
• Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
• A note on the selection of Benders' cuts
• On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs
• Covers and packings in a family of sets
• Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
• The Price of Robustness
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• Improved algorithms for the minmax-regret 1-center and 1-median problems
• Reducibility among Combinatorial Problems
• An analysis of variance test for normality (complete samples)
• Algorithms and Computation
• On the complexity of a class of combinatorial optimization problems with uncertainty

This page was built for publication: Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty