Multiobjective traveling salesperson problem on Halin graphs

European Journal of Operational Research

Volumn 196, Issue 1, 2009, Pages 155-161

  Özpeynirci, Özgür ^a   Köksalan, Murat ^b  

^a IZMIR UNIVERSITY OF ECONOMICS   (Turkey)

^b MIDDLE EAST TECHNICAL UNIVERSITY   (Turkey)

Author keywords

Bottleneck traveling salesperson problem; Computational complexity; Halin graphs; Multiple objectives; Solvable cases; Traveling salesperson problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; MULTIOBJECTIVE OPTIMIZATION; NUCLEAR PROPULSION; TRAVELING SALESMAN PROBLEM;

BOTTLENECK TRAVELING SALESPERSON PROBLEM; HALIN GRAPHS; MULTIPLE OBJECTIVES; SOLVABLE CASES; TRAVELING SALESPERSON PROBLEM;

GRAPH THEORY;

EID: 56549106233     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.04.011     Document Type: Article

References (17)

1. Aneja Y.P., and Nair K.P. Bicriteria transportation problem. Management Science 25 1 (1979) 73-78
2. Baki M.F. A new asymmetric pyramidally solvable class of the traveling salesman problem. Operations Research Letters 34 6 (2006) 613-620
3. Bondy J.A., and Murty U.S.R. Graph Theory with Applications (1979), North-Holland, New York
4. Burkard R.E., Deineko V.G., van Dal R., van der Veen J.A.A., and Woeginger G.J. Well-solvable special cases of the traveling salesman problem: A survey. SIAM Review 40 3 (1998) 496-546
5. Coullard C.R., Rais A., Rardin R.L., and Wagner D.K. Linear-time algorithms for the 2-connected Steiner subgraph problem on special classes of graphs. Networks 23 (1993) 195-206
6. Cournejols G., Naddef D., and Pulleyblank W.R. Halin graphs and the traveling salesman problem. Mathematical Programming 26 (1983) 287-294
7. Deineko W.G., and Woeginger G.J. A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. Mathematical Programming 87 (2000) 519-542
8. Ehrgott M., and Gandibleux X. Multiobjective combinatorial optimization - Theory, methodology, and applications. In: Ehrgott M. (Ed). Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys (2002), Kluwer Academic Publishers, Secaucus 369-444
9. Feillet D., Dejax P., and Gendreau M. Traveling salesman problems with profits. Transportation Science 39 2 (2005) 188-205
10. Gamarnik D., Lewenstein M., and Sviridenko M. An improved upper bound for the TSP in cubic 3-edge-connected graphs. Operations Research Letters 33 5 (2004) 467-474
11. Gilmore R.C., Lawler E.L., and Shmoys D.B. Well-solved special cases. In: Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., and Shmoys D.B. (Eds). The Traveling Salesman Problem (1985), Wiley, Chichester 87-143
12. Kabadi S.N. Polynomially solvable cases of the TSP. In: Gutin G., and Punnen A.P. (Eds). The Traveling Salesman Problem and its Variations (2002), Kluwer Academic Publishers, Dordrecht 489-583
13. Martello S., and Toth P. Knapsack Problems: Algorithms and Computer Implementations (1990), Wiley, Chichester
14. Özpeynirci, Ö., Köksalan, M., 2007. Some polynomially solvable TSPs and multiple objectives, Technical Report 07-04, Industrial Engineering Department, Middle East Technical University.
15. Phillips J.M., Punnen A.P., and Kabadi S.N. A linear time algorithm for the bottleneck travelling salesman problem on a Halin graph. Information Processing Letters 67 (1998) 105-110
16. Steuer R.E. Multiple criteria optimization: Theory, computation and application (1986), John Wiley & Sons, New York
17. Vairaktarakis G.L. On Gilmore-Gomory's open question for the bottleneck TSP. Operations Research Letters 33 6 (2003) 483-491