A Benders decomposition approach for the robust spanning tree problem with interval data
From MaRDI portal
Publication:2503220
DOI10.1016/j.ejor.2005.02.060zbMath1102.90050OpenAlexW2067999800MaRDI QIDQ2503220
Publication date: 14 September 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.02.060
Related Items (35)
Robust inference of trees ⋮ An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion ⋮ A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem ⋮ Robust storage loading problems with stacking and payload constraints ⋮ On the recoverable robust traveling salesman 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 ⋮ New models for the robust shortest path problem: complexity, resolution and generalization ⋮ The robust set covering problem with interval data ⋮ A reformulated Shapley-like value for cooperative games with interval payoffs ⋮ A branch and bound algorithm for the minimax regret spanning arborescence ⋮ Minimax regret spanning arborescences under uncertain costs ⋮ Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis) ⋮ A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty ⋮ 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 ⋮ Minmax regret bottleneck problems with solution-induced interval uncertainty structure ⋮ On a constant factor approximation for minmax regret problems using a symmetry point scenario ⋮ The balanced minimum evolution problem under uncertain data ⋮ On a Class of Interval Data Minmax Regret CO Problems ⋮ Simulated annealing algorithm for the robust spanning tree problem ⋮ Combinatorial two-stage minmax regret problems under interval uncertainty ⋮ Uncertainty in cooperative interval games: how Hurwicz criterion compatibility leads to egalitarianism ⋮ Linear programming with interval right hand sides ⋮ Heuristics for the central tree problem ⋮ Connection situations under uncertainty and cost monotonic solutions ⋮ Robust Critical Node Selection by Benders Decomposition ⋮ Decomposition algorithms for solving the minimum weight maximal matching problem ⋮ Min-max and min-max regret versions of combinatorial optimization problems: A survey ⋮ Approximate cutting plane approaches for exact solutions to robust optimization problems ⋮ A polynomial solvable minimum risk spanning tree problem with interval data ⋮ On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs ⋮ Robust discrete spanning tree problem: local search algorithms ⋮ Cooperative interval games: mountain situations with interval data
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- The computational complexity of the relative robust shortest path problem with interval data
- A branch and bound algorithm for the robust spanning tree problem with interval data
- Partitioning procedures for solving mixed-variables programming problems
- Robust discrete optimization and its applications
- On the robust shortest path problem.
- A branch and bound algorithm for the robust shortest path problem with interval data.
- An exact algorithm for the robust shortest path problem with interval data
- The robust shortest path problem with interval data via Benders decomposition
- Generalized Benders decomposition
- A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
- Tailoring Benders decomposition for uncapacitated network design
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Multicommodity Distribution System Design by Benders Decomposition
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
- On the complexity of a class of combinatorial optimization problems with uncertainty
- The robust spanning tree problem with interval data
This page was built for publication: A Benders decomposition approach for the robust spanning tree problem with interval data
