Skip to main content
SpringerLink
Log in
Book cover

Information and Communication Technologies in Tourism 2013 pp 131–143Cite as

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

  • Conference paper
  • First Online:

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.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Balas, E & Padberg, M. W. (1972). On the Set-Covering Problem. Operations Research Dijkstra, Edsger W. (1965). Cooperating sequential processes (EWD-123). E.W. Dijkstra Archive. Center for American History, University of Texas at Austin.

    Google Scholar 

  • Grimaldi, R. P. (1998). Discrete and Combinatorial Mathematics: An Applied Introduction. 4th edn.ISBN 0-201-19912-2. pp. 244–248.

    Google Scholar 

  • Vazirani, Vijay V. (2001), Approximation Algorithms

    Google Scholar 

  • Yu, G. & Arguello, M. F. (1999). Optimization Engine for Flight Assignment, Scheduling, and Routing of Aircraft in response to irregular operation. U.S. Patent 6,314,361

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Raytheon BBN Technologies, Cambridge, USA

    Moonyoung Kang

Authors
  1. Moonyoung Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Moonyoung Kang .

Editor information

Editors and Affiliations

  1. , Faculty of Communication Sciences, Università della Svizzera italiana, Via Giuseppe Buffi 13, Lugano, 6904, Switzerland

    Lorenzo Cantoni

  2. , College of Merchandising,, University of North Texas, Union Circle 1155, Denton, 76203-1100, Texas, USA

    Zheng (Phil) Xiang

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kang, M. (2013). Integer Programming Formulation of Finding Cheapest Ticket Combination over Multiple Tourist Attractions. In: Cantoni, L., Xiang, Z. (eds) Information and Communication Technologies in Tourism 2013. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36309-2_12

Download citation

Publish with us

Policies and ethics

Search

Navigation