Exact and heuristic algorithms for the interval data robust assignment problem
From MaRDI portal
Publication:632649
DOI10.1016/J.COR.2010.11.009zbMATH Open1208.90107OpenAlexW1968866800MaRDI QIDQ632649FDOQ632649
Authors: Jordi Pereira, Igor Averbakh 
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
Recommendations
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- Complexity of the min-max and min-max regret assignment problems
- The robust set covering problem with interval data
- An improved reduction method for the robust optimization of the assignment problem
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
assignment problemgenetic algorithminterval dataBenders decompositionhybrid heuristicminmax regret optimization
Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Assignment Problems
- Partitioning procedures for solving mixed-variables programming problems
- A genetic algorithm for the set covering problem
- Generalized Benders decomposition
- Title not available (Why is that?)
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Interval data minmax regret network optimization problems
- The robust shortest path problem with interval data via Benders decomposition
- On the complexity of a class of combinatorial optimization problems with uncertainty
- Scatter search. Methodology and implementation in C. With CD-ROM.
- A Benders decomposition approach for the robust spanning tree 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
- The robust set covering problem with interval data
- Ejection chain and filter-and-fan methods in combinatorial optimization
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- Title not available (Why is that?)
- On the History of Combinatorial Optimization (Till 1960)
- Linear Programming on Cray Supercomputers
Cited In (25)
- Algorithms for the minmax regret path problem with interval data
- Robust approach to restricted items selection problem
- Investigating the recoverable robust single machine scheduling problem under interval uncertainty
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
- Robust assignments via ear decompositions and randomized rounding
- Uncertainty in cooperative interval games: how Hurwicz criterion compatibility leads to egalitarianism
- An improved reduction method for the robust optimization of the assignment problem
- Formulation and algorithms for the robust maximal covering location problem
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
- 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
- On the finite optimal convergence of logic-based Benders' decomposition in solving 0-1 min-max regret optimization problems with interval costs
- Complexity of the min-max and min-max regret assignment problems
- Generating hard instances for robust combinatorial optimization
- On exact solutions for the minmax regret spanning tree problem
- The robust set covering problem with interval data
- Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion
- Proportion-based robust optimization and team orienteering problem with interval data
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- Combinatorial two-stage minmax regret problems under interval uncertainty
Uses Software
This page was built for publication: Exact and heuristic algorithms for the interval data robust assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632649)
