New models for the robust shortest path problem: complexity, resolution and generalization (Q367636): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / 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.1007/s10479-011-1004-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972715957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the min-max and min-max regret assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Stage Robust Network Flow and Design Under Demand Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of a class of combinatorial optimization problems with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval data minmax regret network optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3059327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustness and duality in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming with interval right hand sides / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recourse problem of the 2-stage robust location transportation problem / 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: The robust shortest path problem in series -- parallel multidigraphs 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 Benders decomposition approach for the robust spanning tree problem with interval data / 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: Robustness in operational research and decision aiding: a multi-faceted issue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions and methods in decision-aid / 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
 

Latest revision as of 21:41, 6 July 2024

scientific article
Language Label Description Also known as
English
New models for the robust shortest path problem: complexity, resolution and generalization
scientific article

    Statements

    New models for the robust shortest path problem: complexity, resolution and generalization (English)
    0 references
    0 references
    0 references
    0 references
    16 September 2013
    0 references
    robustness analysis
    0 references
    shortest path problem
    0 references
    worst case criterion
    0 references
    integer linear programming
    0 references
    0 references

    Identifiers