Exact and heuristic algorithms for the interval data robust assignment problem (Q632649)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exact and heuristic algorithms for the interval data robust assignment problem |
scientific article; zbMATH DE number 5870570
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact and heuristic algorithms for the interval data robust assignment problem |
scientific article; zbMATH DE number 5870570 |
Statements
Exact and heuristic algorithms for the interval data robust assignment problem (English)
0 references
25 March 2011
0 references
minmax regret optimization
0 references
interval data
0 references
assignment problem
0 references
Benders decomposition
0 references
genetic algorithm
0 references
hybrid heuristic
0 references
0 references
0.8379997611045837
0 references
0.8094838261604309
0 references
0.7934193015098572
0 references
0.7601036429405212
0 references
