Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios (Q1634058)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios |
scientific article |
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
