Exact and heuristic algorithms for the interval data robust assignment problem
From MaRDI portal
(Redirected from Publication:632649)
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
Cites work
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 2064411 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 2196290 (Why is no real title available?)
- A Benders decomposition approach for the robust spanning tree problem with interval data
- A genetic algorithm for the set covering problem
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Assignment Problems
- Complexity of the min-max (regret) versions of min cut problems
- Complexity of the min-max and min-max regret assignment problems
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- Ejection chain and filter-and-fan methods in combinatorial optimization
- Generalized Benders decomposition
- Interval data minmax regret network optimization problems
- Linear Programming on Cray Supercomputers
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- On the History of Combinatorial Optimization (Till 1960)
- On the complexity of a class of combinatorial optimization problems with uncertainty
- Partitioning procedures for solving mixed-variables programming problems
- Scatter search. Methodology and implementation in C. With CD-ROM.
- The robust set covering problem with interval data
- The robust shortest path problem with interval data via Benders decomposition
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
- Formulation and algorithms for the robust maximal covering location problem
- An improved reduction method for the robust optimization of the assignment 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
- On exact solutions for the minmax regret spanning tree problem
- Generating hard instances for robust combinatorial optimization
- 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
- Proportion-based robust optimization and team orienteering problem with interval data
- An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- Combinatorial two-stage minmax regret problems under interval uncertainty
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)
