IDEAS home Printed from https://ideas.repec.org/a/blg/journl/v14y2019i1p208-220.html
   My bibliography  Save this article

Variants Of The Traveling Salesman Problem

Author

Listed:
  • PATTERSON Mike

    (Dillard College of Business, Midwestern State University, USA)

  • FRIESEN Daniel

    (University of North Texas, Dallas Campus, USA)

Abstract

This paper includes an introduction to the concept of spreadsheet optimization and modeling as it specifically applies to combinatorial problems. One of the best known of the classic combinatorial problems is the “Traveling Salesman Problem” (TSP). The classic Traveling Salesman Problem has the objective of minimizing some value, usually distance, while defining a sequence of locations where each is visited once. An additional requirement is that the tour ends in the same location where the tour started. Variants of the classic Traveling Salesman Problem are developed including the Bottleneck TSP and the Variation Bottleneck TSP.

Suggested Citation

  • PATTERSON Mike & FRIESEN Daniel, 2019. "Variants Of The Traveling Salesman Problem," Studies in Business and Economics, Lucian Blaga University of Sibiu, Faculty of Economic Sciences, vol. 14(1), pages 208-220, April.
    • Handle: RePEc:blg:journl:v:14:y:2019:i:1:p:208-220
    as

    Download full text from publisher

    File URL: http://eccsf.ulbsibiu.ro/RePEc/blg/journl/14116patterson.pdf
    Download Restriction: no
    ---><---

    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:blg:journl:v:14:y:2019:i:1:p:208-220. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mihaela Herciu (email available below). General contact details of provider: https://edirc.repec.org/data/feulbro.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.