A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56523986, #quickstatements; #temporary_batch_1710982311091 |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1609.09179 / rank | |||
Normal rank | |||
Revision as of 20:23, 18 April 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
