IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v223y2012i2p333-345.html
   My bibliography  Save this article

The x-and-y-axes travelling salesman problem

Author

Listed:
  • Çela, Eranda
  • Deineko, Vladimir
  • Woeginger, Gerhard J.

Abstract

The x-and-y-axes travelling salesman problem forms a special case of the Euclidean TSP, where all cities are situated on the x-axis and on the y-axis of an orthogonal coordinate system of the Euclidean plane. By carefully analyzing the underlying combinatorial and geometric structures, we show that this problem can be solved in polynomial time. The running time of the resulting algorithm is quadratic in the number of cities.

Suggested Citation

  • Çela, Eranda & Deineko, Vladimir & Woeginger, Gerhard J., 2012. "The x-and-y-axes travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 333-345.
  • Handle: RePEc:eee:ejores:v:223:y:2012:i:2:p:333-345
    DOI: 10.1016/j.ejor.2012.06.036
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712004912
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. van Dal, Rene & van der Veen, Jack A. A. & Sierksma, Gerard, 1993. "Small and large TSP: Two polynomially solvable cases of the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 69(1), pages 107-120, August.
    2. van der Veen, Jack A. A. & Sierksma, Gerard & van Dal, Rene, 1991. "Pyramidal tours and the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 52(1), pages 90-102, May.
    3. Bagchi, Tapan P. & Gupta, Jatinder N.D. & Sriskandarajah, Chelliah, 2006. "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 169(3), pages 816-854, March.
    4. Oda, Yoshiaki, 2002. "An asymmetric analog of van der Veen conditions and the traveling salesman problem (II)," European Journal of Operational Research, Elsevier, vol. 138(1), pages 43-62, April.
    5. Özpeynirci, Özgür & Köksalan, Murat, 2009. "Multiobjective traveling salesperson problem on Halin graphs," European Journal of Operational Research, Elsevier, vol. 196(1), pages 155-161, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wang, Zutong & Guo, Jiansheng & Zheng, Mingfa & Wang, Ying, 2015. "Uncertain multiobjective traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 478-489.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:223:y:2012:i:2:p:333-345. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/eor .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.