The Robust Traveling Salesman Problem with Interval Data

References

• Applegate D., Bixby R., Chvátal V., Cook W. On the solution of traveling salesman problems. Documenta Mathematica (1998) III(Extra Vol. ICM):645–656Google Scholar
• Arora S. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM. (1998) 45(5):753–782Crossref, Google Scholar
• Averbakh I. On the complexity of a class of combinatorial optimization problems with uncertainty. Math. Programming (2001) 90(2):263–272Crossref, Google Scholar
• Averbakh I., Lebedev V. Interval data minmax regret network optimization problems. Discrete Appl. Math. (2004) 138:289–301Crossref, Google Scholar
• Benders J. F. Partitioning procedures for solving mixed integer variables programming problems. Numerische Mathematik (1962) 4:238–252Crossref, Google Scholar
• Daniels R. L., Kouvelis P. Robust scheduling to hedge against processing time uncertainty in single-stage production. Management Sci. (1995) 41(2):363–376Link, Google Scholar
• Dantzig G. B., Fulkerson D. R., Johnson S. M. Solutions of a large scale travelling salesman problem. Oper. Res. (1954) 2:393–410Link, Google Scholar
• Geoffrion A. M. Generalized Benders decomposition. J. Optim. Theory Appl. (1972) 10(4):237–260Crossref, Google Scholar
• Helsgaun K. An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. (2000) 126(1):106–130Crossref, Google Scholar
• Hochbaum D. S.Approximation Algorithms for NP-Hard Problems (1995) (PWS Publishing Company, Boston, MA) Google Scholar
• Karaşan O. E., Pinar M. Ç., Yaman H. The robust shortest path problem with interval data. (2001) . Technical report, Bilkent University, Ankara, TurkeyGoogle Scholar
• Kasperski A., Zieliński P. An approximation algorithm for interval data minmax regret combinatorial optimization problems. Inform. Processing Lett. (2006) 97:171–180Crossref, Google Scholar
• Kouvelis P., Yu G.Robust Discrete Optimization and Its Applications (1997) (Kluwer Academic Publishers, Dordrecht/Boston/London) Crossref, Google Scholar
• Langevin A., Soumis F., Desrosiers J. Classification of travelling salesman formulations. Oper. Res. Lett. (1990) 9:127–132Crossref, Google Scholar
• Laporte G., Louveaux F. V., Mercure H. The vehicle routing problem with stochastic travel times. Transportation Sci. (1992) 26:161–170Link, Google Scholar
• Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Shmoys D. B.The Traveling Salesman Problem (1985) (Wiley, Chichester, UK) Google Scholar
• Letchford A. N., Reinelt G., Theis D. O. A faster exact separation algorithm for blossom inequalities. 10th Internat. IPCO Conf. Lectures Notes in Computer Sci. (2004) 3064:196–205Google Scholar
• Montemanni R., Gambardella L. M. An exact algorithm for the robust shortest path problem with interval data. Comput. Oper. Res. (2004) 31(10):1667–1680Crossref, Google Scholar
• Montemanni R., Gambardella L. M., Donati A. V. A branch and bound algorithm for the robust shortest path problem with interval data. Oper. Res. Lett. (2004) 32(3):225–232Crossref, Google Scholar
• Nagamochi H., Ono T., Ibaraki T. Implementing an efficient minimum capacity cut algorithm. Math. Programming (1994) 67:325–341Crossref, Google Scholar
• Reinelt G.The Traveling Salesman: Computational Solutions for TSP Applications (1994) (Springer-Verlag, Berlin, Germany) Google Scholar
• Yaman H., Karaşan O. E., Pinar M. Ç. The robust spanning tree problem with interval data. Oper. Res. Lett. (2001) 29:31–40Crossref, Google Scholar
• Yu G., Yang J. On the robust shortest path problem. Comput. Oper. Res. (1998) 25(6):457–468Crossref, Google Scholar