A branch and bound algorithm for the robust shortest path problem with interval data. (Q1426725): Difference between revisions
From MaRDI portal
Revision as of 15:00, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A branch and bound algorithm for the robust shortest path problem with interval data. |
scientific article |
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