A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs |
scientific article |
Statements
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (English)
0 references
11 July 2018
0 references
robust optimization
0 references
matheuristics
0 references
Benders' decomposition
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
