A branch and bound algorithm for the robust shortest path problem with interval data. (Q1426725): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Shortest path problems with partial information: Models and algorithms for detecting dominance / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on two problems in connexion with graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Robust discrete optimization and its applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An exact algorithm for the robust shortest path problem with interval data / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The robust spanning tree problem with interval data / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the robust shortest path problem. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The computational complexity of the relative robust shortest path problem with interval data / rank | |||
Normal rank | |||
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
