Algorithms for the Minmax Regret Path problem with interval data-Reference-Cited by-同舟云学术

Algorithms for the Minmax Regret Path problem with interval data

Published:2018-09 Issue: Volume:462 Page:218-241
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Pérez-Galarce Francisco,Candia-Véjar Alfredo,Astudillo César^ORCID,Bardeen Matthew

Funder

CONICYT

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference47 articles.

1. Fine-tuning of algorithms using fractional experimental designs and local search;Adenso-Diaz;Oper. Res.,2006

2. Network Flows: Theory, Algorithms, and Applications;Ahuja,1993

3. A survey of very large-scale neighborhood search techniques;Ahuja;Discr. Appl. Math.,2002

4. Min-max and min-max regret versions of combinatorial optimization problems: a survey;Aissi;Eur. J. Oper. Res.,2009

5. Interval data minmax regret network optimization problems;Averbakh;Discr. Appl. Math.,2004

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Robust reverse 1-center problems on trees with interval costs;Optimization Methods and Software;2024-05-21

2. The Minmax Regret Longest Path of a Tree with Interval Edge Lengths;Advances in Information and Communication Technology;2023

3. Improved robust shortest paths by penalized investments;RAIRO - Operations Research;2021-05

4. Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making;Mathematical Programming;2021-02-22

5. A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty;International Transactions in Operational Research;2021-02-18