An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and minimizing the relative regret in combinatorial optimization with interval data / 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: Genetic Algorithms and Random Keys for Sequencing and Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization-methodology and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Stochastic Shortest Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / 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: On a constant factor approximation for minmax regret problems using a symmetry point scenario / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints / 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: The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some tractable instances of interval data minmax regret problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New models for the robust shortest path problem: complexity, resolution and generalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest path methods: A unifying approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the resource constrained multi-project scheduling 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: On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mersenne twister / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random key based genetic algorithm for the resource constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the robust spanning tree 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: Algorithms for the minmax regret path problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A biased random-key genetic algorithm for the Steiner triple covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Search and Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Looking ahead with the pilot method / rank
 
Normal rank

Revision as of 12:14, 9 July 2024

scientific article
Language Label Description Also known as
English
An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
scientific article

    Statements

    An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (English)
    0 references
    15 January 2015
    0 references
    robust shortest path
    0 references
    uncertain data
    0 references
    heuristics
    0 references
    mathematical modeling
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references