Exact and heuristic algorithms for the interval data robust assignment problem
type: Item
instance of: scholarly article
title: Exact and heuristic algorithms for the interval data robust assignment problem
zbMATH Open document ID: 1208.90107
author: Jordi Pereira
author: Igor Averbakh
published in: Computers \& Operations Research
publication date: 2011-03-25T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5870570
zbMATH Keywords: minmax regret optimization
zbMATH Keywords: interval data
zbMATH Keywords: assignment problem
zbMATH Keywords: Benders decomposition
zbMATH Keywords: genetic algorithm
zbMATH Keywords: hybrid heuristic
describes a project that uses: Scatter Search
describes a project that uses: OR-Library
describes a project that uses: Tabu search
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.cor.2010.11.009
OpenAlex ID: W1968866800
cites work: Complexity of the min-max and min-max regret assignment problems
cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey
cites work: Complexity of the min-max (regret) versions of min cut problems
cites work: On the complexity of a class of combinatorial optimization problems with uncertainty
cites work: Interval data minmax regret network optimization problems
cites work: Linear Programming on Cray Supercomputers
cites work: A genetic algorithm for the set covering problem
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Q5465123
cites work: Assignment Problems
cites work: Generalized Benders decomposition
cites work: Q4354785
cites work: Ejection chain and filter-and-fan methods in combinatorial optimization
cites work: Q4692508
cites work: A shortest augmenting path algorithm for dense and sparse linear assignment problems
cites work: Discrete optimization with interval data. Minmax regret and fuzzy approach
cites work: Scatter search. Methodology and implementation in C. With CD-ROM.
cites work: A Benders decomposition approach for the robust spanning tree problem with interval data
cites work: The robust shortest path problem with interval data via Benders decomposition
cites work: The robust set covering problem with interval data
cites work: Q4461910
cites work: On the History of Combinatorial Optimization (Till 1960)
DOI: 10.1016/J.COR.2010.11.009
description: scientific article; zbMATH DE number 5870570