Author:
Coco Amadeu Almeida,Júnior João Carlos Abreu,Noronha Thiago F.,Santos Andréa Cynthia
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization,Computer Science Applications
Reference5 articles.
1. Averbakh, I.: Computing and minimizing the relative regret in combinatorial optimization with interval data. Discrete Optim. 2, 273–287 (2005)
2. Coco, A.A., Júnior, J.C.A., Noronha, T.F., Santos, A.C.: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem. J. Glob. Optim. 60(2), 265–287 (2014)
3. Karasan, O.E., Yaman, H., Ç. Pinar, M.: The robust shortest path problem with interval data. Tech. rep., Bilkent University, Department of Industrial Engineering (2001)
4. Kouvelis, P., Yu, G.: Robust Discrete Optimization and Its Applications. Kluwer Academic Publishers, Dordrecht (1997)
5. Mausser, H.E., Laguna, M.: Minimising the maximum relative regret for linear programming with interval objective function coefficients. J. Oper. Res. Soc. 50, 1063–1070 (1999)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献