A branch and bound algorithm for the robust shortest path problem with interval data. (Q1426725): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q706973 / rank
Normal rank
 
Property / author
 
Property / author: Alberto V. Donati / rank
Normal rank
 
Property / author
 
Property / author: Luca Maria Gambardella / rank
 
Normal rank
Property / author
 
Property / author: Alberto V. Donati / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2003.08.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2103776399 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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

    Identifiers