An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
From MaRDI portal
Publication:486397
DOI10.1007/S10898-014-0187-XzbMATH Open1312.90082OpenAlexW1981265300MaRDI QIDQ486397FDOQ486397
Authors: Amadeu Almeida Coco, João Abreu, Thiago F. Noronha, Andréa Cynthia Santos 
Publication date: 15 January 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0187-x
Recommendations
- The minmax regret robust shortest path problem in a finite multi-scenario model
- Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- A MILP-based VND for the min-max regret shortest path tree problem with interval costs
- Algorithms for the minmax regret path problem with interval data
- Reduction approaches for robust shortest path problems
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Minimax problems in mathematical programming (90C47) Integer programming (90C10)
Cites Work
- A biased random-key genetic algorithm for the Steiner triple covering problem
- A branch and bound algorithm for the robust shortest path problem with interval data.
- A branch and bound algorithm for the robust spanning tree problem with interval data
- A genetic algorithm for the resource constrained multi-project scheduling problem
- A note on two problems in connexion with graphs
- A random key based genetic algorithm for the resource constrained project scheduling problem
- Algorithms for the minmax regret path problem with interval data
- An Analysis of Stochastic Shortest Path Problems
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Graph theory with applications
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Integer Programming Formulation of Traveling Salesman Problems
- Interval data minmax regret network optimization problems
- Introduction to Stochastic Search and Optimization
- Looking ahead with the pilot method
- Mersenne twister
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Minmax regret combinatorial optimization problems: an algorithmic perspective
- Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem
- New models for the robust shortest path problem: complexity, resolution and generalization
- On a constant factor approximation for minmax regret problems using a symmetry point scenario
- On a routing problem
- On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
- Optimization by simulated annealing
- Reduction approaches for robust shortest path problems
- Robust discrete optimization and its applications
- Robust optimization-methodology and applications
- Shortest path methods: A unifying approach
- Some tractable instances of interval data minmax regret problems
- The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
- The robust shortest path problem in series -- parallel multidigraphs with interval data
- The robust shortest path problem with interval data via Benders decomposition
- The robust spanning tree problem with interval data
Cited In (16)
- Algorithms for the minmax regret path problem with interval data
- The minmax regret robust shortest path problem in a finite multi-scenario model
- A utility theory based interactive approach to robustness in linear optimization
- Reduction approaches for robust shortest path problems
- A minmax regret version of the time-dependent shortest path problem
- Formulation and algorithms for the robust maximal covering location problem
- Robust min-max regret covering problems
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty
- A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
- On the finite optimal convergence of logic-based Benders' decomposition in solving 0-1 min-max regret optimization problems with interval costs
- A MILP-based VND for the min-max regret shortest path tree problem with interval costs
- Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios
- An enhanced exact procedure for the absolute robust shortest path problem
Uses Software
This page was built for publication: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486397)
