The robust shortest path problem with interval data via Benders decomposition
From MaRDI portal
Publication:2507502
DOI10.1007/s10288-005-0066-xzbMath1134.90538OpenAlexW2161704166MaRDI QIDQ2507502
Luca Maria Gambardella, Roberto Montemanni
Publication date: 11 October 2006
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-005-0066-x
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Minimax problems in mathematical programming (90C47) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (35)
The minmax regret robust shortest path problem in a finite multi-scenario model ⋮ Recoverable robust shortest path problems ⋮ Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem ⋮ On exact solutions for the minmax regret spanning tree problem ⋮ A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs ⋮ Optimization under Decision-Dependent Uncertainty ⋮ New models for the robust shortest path problem: complexity, resolution and generalization ⋮ The robust set covering problem with interval data ⋮ Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis) ⋮ A double oracle approach to minmax regret optimization problems with interval data ⋮ A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty ⋮ Min-max and min-max (relative) regret approaches to representatives selection problem ⋮ The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows ⋮ Algorithms for the minmax regret path problem with interval data ⋮ Exact and heuristic algorithms for the interval data robust assignment problem ⋮ Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints ⋮ On a constant factor approximation for minmax regret problems using a symmetry point scenario ⋮ Min max min robust (relative) regret combinatorial optimization ⋮ The balanced minimum evolution problem under uncertain data ⋮ Risk-control approach for bottleneck transportation problem with randomness and fuzziness ⋮ An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem ⋮ An enhanced exact procedure for the absolute robust shortest path problem ⋮ Linear programming with interval right hand sides ⋮ Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios ⋮ Constrained optimization problems under uncertainty with coherent lower previsions ⋮ Reduction approaches for robust shortest path problems ⋮ Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network ⋮ A Benders decomposition approach for the robust spanning tree problem with interval data ⋮ Extensions of labeling algorithms for multi‐objective uncertain shortest path problems ⋮ A minmax regret version of the time-dependent shortest path problem ⋮ Min-max and min-max regret versions of combinatorial optimization problems: A survey ⋮ Convexity and optimization with copulæ structured probabilistic constraints ⋮ On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs ⋮ Robust Optimization for the Hazardous Materials Transportation Network Design Problem ⋮ Robust optimization for the hazardous materials transportation network design problem
This page was built for publication: The robust shortest path problem with interval data via Benders decomposition
