Exact and heuristic algorithms for the interval data robust assignment problem
From MaRDI portal
Publication:632649
DOI10.1016/j.cor.2010.11.009zbMath1208.90107OpenAlexW1968866800MaRDI QIDQ632649
Publication date: 25 March 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.11.009
genetic algorithmassignment problemBenders decompositioninterval datahybrid heuristicminmax regret optimization
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (21)
Robust approach to restricted items selection problem ⋮ Investigating the recoverable robust single machine scheduling problem under interval uncertainty ⋮ An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion ⋮ Heuristic algorithms for the minmax regret flow-shop problem with interval processing times ⋮ Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem ⋮ On exact solutions for the minmax regret spanning tree problem ⋮ A decomposition based solution algorithm for U-type assembly line balancing with interval data ⋮ A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs ⋮ The robust (minmax regret) assembly line worker assignment and balancing problem ⋮ The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective ⋮ The robust set covering problem with interval data ⋮ The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows ⋮ Algorithms for the minmax regret path problem with interval data ⋮ A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines ⋮ Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion ⋮ Formulation and algorithms for the robust maximal covering location problem ⋮ Combinatorial two-stage minmax regret problems under interval uncertainty ⋮ Uncertainty in cooperative interval games: how Hurwicz criterion compatibility leads to egalitarianism ⋮ Generating hard instances for robust combinatorial optimization ⋮ Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients ⋮ On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs
Uses Software
Cites Work
- The robust set covering problem with interval data
- Complexity of the min-max and min-max regret assignment problems
- Complexity of the min-max (regret) versions of min cut problems
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Partitioning procedures for solving mixed-variables programming problems
- A genetic algorithm for the set covering problem
- Interval data minmax regret network optimization problems
- Scatter search. Methodology and implementation in C. With CD-ROM.
- A Benders decomposition approach for the robust spanning tree problem with interval data
- The robust shortest path problem with interval data via Benders decomposition
- Generalized Benders decomposition
- Linear Programming on Cray Supercomputers
- Assignment Problems
- On the History of Combinatorial Optimization (Till 1960)
- Ejection chain and filter-and-fan methods in combinatorial optimization
- On the complexity of a class of combinatorial optimization problems with uncertainty
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Exact and heuristic algorithms for the interval data robust assignment problem
