On a Class of Interval Data Minmax Regret CO Problems
暂无分享,去创建一个
[1] Igor Averbakh,et al. Interval data minmax regret network optimization problems , 2004, Discret. Appl. Math..
[2] Adam Kasperski,et al. An approximation algorithm for interval data minmax regret combinatorial optimization problems , 2006, Inf. Process. Lett..
[3] Igor Averbakh,et al. On the complexity of a class of combinatorial optimization problems with uncertainty , 2001, Math. Program..
[4] Roberto Montemanni,et al. A Benders decomposition approach for the robust spanning tree problem with interval data , 2006, Eur. J. Oper. Res..
[5] Hande Yaman,et al. The robust spanning tree problem with interval data , 2001, Oper. Res. Lett..
[6] Eduardo Conde,et al. Minimax regret spanning arborescences under uncertain costs , 2007, Eur. J. Oper. Res..
[7] A Gerodimos,et al. Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..
[8] Pawel Zielinski,et al. The computational complexity of the relative robust shortest path problem with interval data , 2004, Eur. J. Oper. Res..
[9] János Barta,et al. The Robust Traveling Salesman Problem with Interval Data , 2006, Transp. Sci..
[10] David Eppstein,et al. Finding the k Shortest Paths , 1999, SIAM J. Comput..