A branch and bound algorithm for the robust shortest path problem with interval data. (Q1426725)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch and bound algorithm for the robust shortest path problem with interval data. |
scientific article; zbMATH DE number 2057194
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for the robust shortest path problem with interval data. |
scientific article; zbMATH DE number 2057194 |
Statements
A branch and bound algorithm for the robust shortest path problem with interval data. (English)
0 references
15 March 2004
0 references
Branch and bound
0 references
Shortest path problem
0 references
Robust optimization
0 references
Interval data
0 references
0 references
