Skip to main content
SpringerLink
Log in

A new solvable case of the traveling salesman problem

  • Short Communication
  • Published:
Mathematical Programming Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. F. Harary and R.Z. Norman, “Some properties of line digraphs”,Rendiconto del Circolo Matematico di Palermo 9 (1960) 161–168.

    Google Scholar 

  2. R.M. Karp, “Reducibility among combinatorial problems”, in:Proceedings of the Symposium on the Complexity of Computer Computations, Eds. R.E. Miller and J.W. Thatcher (Plenum Press, New York, 1972).

    Google Scholar 

  3. P. Kestelyn, “A soluble self-avoiding walk problem,”Physica 29 (1963) 1329–1337.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Wrocław, Wrocław, Poland

    Maciej M. Sysło

Authors
  1. Maciej M. Sysło
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sysło, M.M. A new solvable case of the traveling salesman problem. Mathematical Programming 4, 347–348 (1973). https://doi.org/10.1007/BF01584676

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01584676

Keywords

Search

Navigation