Minmax regret solutions for minimax optimization problems with uncertainty-Reference-Cited by-同舟云学术

Minmax regret solutions for minimax optimization problems with uncertainty

Published:2000-09 Issue:2 Volume:27 Page:57-65
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Averbakh Igor

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference28 articles.

1. Bottleneck Steiner subnetwork problems with k-connectivity constraints;Averbakh;INFORMS J. Comput.,1996

2. I. Averbakh, O. Berman, Minmax regret median location on a network under uncertainty, INFORMS J. Comput., to appear.

3. I. Averbakh, O. Berman, Minmax regret p-center location on a network with demand uncertainty, Working paper, University of Toronto, Faculty of Management, Toronto, 1996.

4. Optimal minimax path of a single service unit on a network to nonservice destinations;Berman;Transp. Sci.,1987

5. Online Computation and Competitive Analysis;Borodin,1998

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

1. Min–max relative regret for scheduling to minimize maximum lateness;Annals of Operations Research;2024-07-05

2. Other Models for Robust Optimization;International Series in Operations Research & Management Science;2024

3. Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness;Lecture Notes in Computer Science;2023

4. The two-echelon island fuel distribution problem;European Journal of Operational Research;2022-11

5. A state-of-the-art survey on multi-scenario scheduling;European Journal of Operational Research;2022-11