A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2016.12.010 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2016.12.010 / rank | |||
Normal rank | |||
Latest revision as of 01:02, 11 December 2024
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
