A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty

Related Items (2)

Patient admission scheduling problems with uncertain length of stay: optimization models and an efficient matheuristic approach ⋮ The coupled task scheduling problem: an improved mathematical program and a new solution algorithm

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
A note on two problems in connexion with graphs
Integer programming formulations for the elementary shortest path problem
On exact solutions for the minmax regret spanning tree problem
A fix-and-optimize heuristic for the high school timetabling problem
An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions
A branch and bound algorithm for the robust spanning tree problem with interval data
Reduction approaches for robust shortest path problems
A branch and bound algorithm for the minimax regret spanning arborescence
Minimax regret spanning arborescences under uncertain costs
Simulated annealing algorithm for the robust spanning tree problem
An approximation algorithm for interval data minmax regret combinatorial optimization problems
The fleet size and mix vehicle routing problem
Unit disk graphs
Robust discrete optimization and its applications
Variable neighborhood search
Robust discrete optimization and network flows
A branch and bound algorithm for the robust shortest path problem with interval data.
Robust solutions of linear programming problems contaminated with uncertain data
Mixed integer programming based heuristics for the patient admission scheduling problem
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions
Exploring relaxation induced neighborhoods to improve MIP solutions
A MILP-based VND for the min-max regret shortest path tree problem with interval costs
Interval data minmax regret network optimization problems
An exact algorithm for the robust shortest path problem with interval data
Algorithms for the minmax regret path problem with interval data
Improved flow-based formulations for the skiving stock problem
On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust shortest path problem with interval data via Benders decomposition
Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
The robust minimum spanning tree problem: compact and convex uncertainty
A Multiple Comparison Procedure for Comparing Several Treatments with a Control
The Price of Robustness
An analysis of variance test for normality (complete samples)
Random Graphs
The robust spanning tree problem with interval data

This page was built for publication: A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty