An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C47 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6386995 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
robust shortest path | |||
| Property / zbMATH Keywords: robust shortest path / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
uncertain data | |||
| Property / zbMATH Keywords: uncertain data / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
heuristics | |||
| Property / zbMATH Keywords: heuristics / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
mathematical modeling | |||
| Property / zbMATH Keywords: mathematical modeling / rank | |||
Normal rank | |||
Revision as of 20:37, 30 June 2023
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
