IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-36309-2_12.html
   My bibliography  Save this book chapter

Integer Programming Formulation of Finding Cheapest Ticket Combination over Multiple Tourist Attractions

In: Information and Communication Technologies in Tourism 2013

Author

Listed:
  • Moonyoung Kang

    (Raytheon BBN Technologies)

Abstract

Tourist attractions often provide multiple ticket options, such as student tickets, group tickets, inter-attraction combo tickets, free admission on a certain date, and etc. With these various ticket options, finding the cheapest but feasible ticket combination covering all tourist attractions a traveller plans to visit may not be trivial. This paper describes how we convert a cheapest ticket combination problem into a mathematically well-defined set cover problem and solves it through integer linear programming in practical amount of time. We tested our system with various admission tickets in New York City, one of the largest tourist destinations.

Suggested Citation

  • Moonyoung Kang, 2013. "Integer Programming Formulation of Finding Cheapest Ticket Combination over Multiple Tourist Attractions," Springer Books, in: Lorenzo Cantoni & Zheng (Phil) Xiang (ed.), Information and Communication Technologies in Tourism 2013, edition 127, pages 131-143, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-36309-2_12
    DOI: 10.1007/978-3-642-36309-2_12
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Wolfgang Wörndl & Alexander Hefele & Daniel Herzog, 2017. "Recommending a sequence of interesting places for tourist trips," Information Technology & Tourism, Springer, vol. 17(1), pages 31-54, March.
    2. Wolfgang Wörndl & Alexander Hefele & Daniel Herzog, 0. "Recommending a sequence of interesting places for tourist trips," Information Technology & Tourism, Springer, vol. 0, pages 1-24.

    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:spr:sprchp:978-3-642-36309-2_12. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.