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