An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10898-014-0187-x / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10898-014-0187-X / rank | |||
Normal rank | |||
Revision as of 02:34, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem |
scientific article |
Statements
An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (English)
0 references
15 January 2015
0 references
robust shortest path
0 references
uncertain data
0 references
heuristics
0 references
mathematical modeling
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
