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-xzbMath1312.90082OpenAlexW1981265300MaRDI QIDQ486397
Thiago F. Noronha, João Carlos Abreu Júnior, Amadeu Almeida Coco, 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
Programming involving graphs or networks (90C35) Integer programming (90C10) Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (8)
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs ⋮ Robust min-max regret covering problems ⋮ Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem ⋮ A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty ⋮ Algorithms for the minmax regret path problem with interval data ⋮ Formulation and algorithms for the robust maximal covering location problem ⋮ A utility theory based interactive approach to robustness in linear optimization ⋮ On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs
Uses Software
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- Optimization by Simulated Annealing
- 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
- A biased random-key genetic algorithm for the Steiner triple covering problem
- A branch and bound algorithm for the robust spanning tree problem with interval data
- Reduction approaches for robust shortest path problems
- Looking ahead with the pilot method
- A random key based genetic algorithm for the resource constrained project scheduling problem
- Some tractable instances of interval data minmax regret problems
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- Robust discrete optimization and its applications
- A branch and bound algorithm for the robust shortest path problem with interval data.
- Interval data minmax regret network optimization problems
- Robust optimization-methodology and applications
- Algorithms for the minmax regret path problem with interval data
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
- A genetic algorithm for the resource constrained multi-project scheduling problem
- The robust shortest path problem with interval data via Benders decomposition
- The robust shortest path problem in series -- parallel multidigraphs with interval data
- The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
- On a routing problem
- Integer Programming Formulation of Traveling Salesman Problems
- Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem
- Shortest path methods: A unifying approach
- An Analysis of Stochastic Shortest Path Problems
- Mersenne twister
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Introduction to Stochastic Search and Optimization
- Minmax regret combinatorial optimization problems: an Algorithmic Perspective
- The robust spanning tree problem with interval data
This page was built for publication: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
