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

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

Cites Work

An extension on ``Statistical comparisons of classifiers over multiple data sets for all pairwise comparisons
Reducibility among combinatorial problems
Partitioning procedures for solving mixed-variables programming problems
The Price of Robustness
Title not available (Why is that?)
An analysis of variance test for normality (complete samples)
Robust discrete optimization and its applications
Robust solutions of linear programming problems contaminated with uncertain data
A note on the selection of Benders' cuts
Min-max and min-max regret versions of combinatorial optimization problems: A survey
Interval data minmax regret network optimization problems
Complexity of minimizing the total flow time with interval data and minmax regret criterion
On the complexity of a class of combinatorial optimization problems with uncertainty
The polynomial-time hierarchy
Improved algorithms for the minmax-regret 1-center and 1-median problems
A fix-and-optimize heuristic for the high school timetabling problem
An approximation algorithm for interval data minmax regret combinatorial optimization problems
On the complexity of minmax regret linear programming
Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
Complexity of the min-max and min-max regret assignment problems
Complexity of robust single facility location problems on networks with uncertain edge lengths.
Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
On integer points in polyhedra
Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions
Title not available (Why is that?)
Min-max and min-max (relative) regret approaches to representatives selection problem
Formulation and algorithms for the robust maximal covering location problem
Algorithms and Computation
Pinpointing the complexity of the interval min-max regret knapsack problem
A branch and bound algorithm for the minimax regret spanning arborescence
Covers and packings in a family of sets
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 finite optimal convergence of logic-based Benders' decomposition in solving 0-1 min-max regret optimization problems with interval costs
Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions
Complexity of the robust weighted independent set problems on interval graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186579)