Algorithms for the minmax regret path problem with interval data

DOI10.1016/J.INS.2018.06.016MaRDI QIDQ2198244zbMATH OpenOpenAlexFDO

Authors Francisco Pérez-Galarce, Alfredo Candia-Véjar, Matthew Bardeen, César A. Astudillo

Publication date 9 September 2020

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2018.06.016

zbMATH Keywords

simulated annealingshortest path problembranch and cutminmax regret model with interval dataneighbourhoods for path problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• Some tractable instances of interval data minmax regret problems
• Interval data minmax regret network optimization problems
• Computing and minimizing the relative regret in combinatorial optimization with interval data
• On a Class of Interval Data Minmax Regret CO Problems
• Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality
• On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
• scientific article; zbMATH DE number 721836
• Minmax regret bottleneck problems with solution-induced interval uncertainty structure
• Minmax regret combinatorial optimization problems: an algorithmic perspective

Cites work

• A Benders decomposition approach for the robust spanning tree problem with interval data
• A branch and bound algorithm for the robust shortest path problem with interval data.
• A double oracle approach to minmax regret optimization problems with interval data
• A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems
• A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
• A note on two problems in connexion with graphs
• A survey of very large-scale neighborhood search techniques
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• An exact algorithm for the robust shortest path problem with interval data
• An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
• Discrete optimization with interval data. Minmax regret and fuzzy approach
• Exact and heuristic algorithms for the interval data robust assignment problem
• Extensions of labeling algorithms for multi-objective uncertain shortest path problems
• Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
• Interval data minmax regret network optimization problems
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Minimax regret spanning arborescences under uncertain costs
• Minmax regret combinatorial optimization problems: an algorithmic perspective
• Minmax robustness for multi-objective optimization problems
• Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
• Network flows. Theory, algorithms, and applications.
• On exact solutions for the minmax regret spanning tree problem
• On the robust shortest path problem.
• Optimization by simulated annealing
• Priority-Based Genetic Algorithm for Shortest Path Routing Problem in OSPF
• Robust discrete optimization and its applications
• Robust shortest path problem based on a confidence interval in fuzzy bicriteria decision making
• Shortest path problem with uncertain arc lengths
• Simulated annealing algorithm for the robust spanning tree problem
• Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality
• The computational complexity of the relative robust shortest path problem with interval data
• The minmax regret robust shortest path problem in a finite multi-scenario model
• The robust set covering problem with interval data
• The robust shortest path problem with interval data via Benders decomposition
• Tuning metaheuristics. A machine learning Perspective
• Using experimental design to find effective parameter settings for heuristics

Cited in

(13)

• Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making
• The minmax regret robust shortest path problem in a finite multi-scenario model
• Reduction approaches for robust shortest path problems
• An acceptability index based approach for solving shortest path problem on a network with interval weights
• Interval data minmax regret network optimization problems
• On a Class of Interval Data Minmax Regret CO Problems
• A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty
• A MILP-based VND for the min-max regret shortest path tree problem with interval costs
• Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients
• An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
• Complexity of minimizing the total flow time with interval data and minmax regret criterion
• The rough interval shortest path problem
• Robust reverse 1-center problems on trees with interval costs

This page was built for publication: Algorithms for the minmax regret path problem with interval data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198244)