Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios (Q1634058)
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: Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios |
scientific article; zbMATH DE number 6994268
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios |
scientific article; zbMATH DE number 6994268 |
Statements
Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios (English)
0 references
17 December 2018
0 references
minmax regret models
0 references
Benders decomposition
0 references
scheduling problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
