• Title of article

    Pyramidal traveling salesman problem

  • Author/Authors

    Md. Fazle Baki، نويسنده , , Santosh N. Kabadi، نويسنده ,

  • Issue Information
    دوهفته نامه با شماره پیاپی سال 1999
  • Pages
    17
  • From page
    353
  • To page
    369
  • Abstract
    In this paper, we give new polynomially testable sufficiency conditions for a given instance of the traveling salesman problem (TSP) to have an optimal tour that is pyramidal. This properly generalizes the Demidenko condition and the conditions of Warren. We thus have new, nontrivial polynomially testable and polynomially solvable cases of TSP.
  • Keywords
    Traveling salesman problem , Polynomial algorithm , Pyramidal tour
  • Journal title
    Computers and Operations Research
  • Serial Year
    1999
  • Journal title
    Computers and Operations Research
  • Record number

    927008

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=927008