The minmax regret robust shortest path problem in a finite multi-scenario model (Q279255): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An enhanced exact procedure for the absolute robust shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax regret combinatorial optimization problems: an Algorithmic Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction approaches for robust shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion shortest path algorithm / 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: Finding the k Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3059327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in robust optimization: an overview / 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: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new implementation of Yen's ranking loopless paths algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS / 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 shortest path problem with interval data via Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the robust shortest path problem with interval data. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving min-max shortest-path problems on a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the robust shortest path problem. / rank
 
Normal rank

Latest revision as of 21:47, 11 July 2024

scientific article
Language Label Description Also known as
English
The minmax regret robust shortest path problem in a finite multi-scenario model
scientific article

    Statements

    The minmax regret robust shortest path problem in a finite multi-scenario model (English)
    0 references
    0 references
    0 references
    27 April 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    network
    0 references
    scenario
    0 references
    minmax regret
    0 references
    robust shortest path
    0 references
    labeling
    0 references
    ranking
    0 references
    0 references