1 |
Inuiguchi, M. and Sakawa, M.; "Minimax Regret Solution To Linear-Programming Problems With An Interval Objective Function," European Journal of Operational Research, 86(3) : 526-536, 1995.
DOI
ScienceOn
|
2 |
Kang, J.-G.; "A Heuristic Algorithm to Find the Minimax Regret Longest Path Problem with Interval Lengths," Journal of the Korea Management Engineers Society, 14(3) : 35-46, 2009.
|
3 |
Kang, J.-G.; "Minmax Regret Approach to Disassembly Sequence Planning with Interval Data," Journal of Society of Korea Industrial and Systems Engineering, 32(4) : 192-202, 2009.
|
4 |
Kang, J.-G. and Brissaud, D.; "A Product Lifecycle Costing System with Imprecise End-of-Life Data," in the 14th CIRP Conference on Life Cycle Engineering, Waseda University, Japan, 2007.
|
5 |
Kang, J.-G., Lee, D.-H., and Xirouchakis, P.; "Disassembly Sequencing with Imprecise Data: a Case Study," International Journal of Industrial Engineering-Theory, Applications and Practice, 10(4) : 407-412, 2003.
|
6 |
Karasan, O. E., Pinar, M., and Yaman, H.; "The Robust Shortest Path Problem with Interval Data[Online]," Available at : http://www.ie.bilkent.edu.tr/-mustafap/pubs/.
|
7 |
Kasperski, A. and Zielinski, P.; "An approximation algorithm for interval data minmax regret combinatorial optimization problems," Information Processing Letters, 97(5) : 177-180, 2006.
DOI
ScienceOn
|
8 |
Kouvelis, P. and Yu, G.; Robust Discrete Optimization and Its Application. Boston. : Kluwer Academic Publishers, 1997.
|
9 |
Montemanni, R. and Gambardella, L. M.; "An Exact Algorithm for the Robust Shortest Path Problem with Interval Data," Computers and Operations Research, 31(10) : 1667-1680, 2004.
DOI
ScienceOn
|
10 |
Montemanni, R. and Gambardella, L. M.; "A branch and bound algorithm for the robust spanning tree problem with interval data," European Journal of Operational Research, 161(3) : 771-779, 2005.
DOI
ScienceOn
|
11 |
Zieliski, P.; "The computational complexity of the relative robust shortest path problem with interval data," European Journal of Operational Research, 158(3) : 570-576, 2004.
DOI
ScienceOn
|
12 |
Eppstein, D.; "Finding the k shortest paths," SIAM Journal on Computing, 28(2) : 652-673, 1998.
DOI
ScienceOn
|
13 |
Averbakh, I. and Lebedev, V.; "Interval data minmax regret network optimization problems," Discrete Applied Mathematics, 138 : 289-301, 2004.
DOI
ScienceOn
|
14 |
Chanas, S. and Zieliski, P.; "The computational complexity of the criticality problems in a network with interval activity times," European Journal of Operational Research, 136(3) : 541-550, 2002.
DOI
ScienceOn
|
15 |
Conde, E.; "A minmax regret approach to the critical path method with task interval times," European Journal of Operational Research, 197(1) : 235-242, 2009.
DOI
ScienceOn
|