Skip to main content
SpringerLink
Log in

The Prize Collecting Connected Subgraph Problem - A New NP-Hard Problem arising in Snow Removal Routing

  • Conference paper
Operations Research Proceedings 2004

Part of the book series: Operations Research Proceedings ((ORP,volume 2004))

  • 6672 Accesses

Abstract

We consider a new NP-hard optimization problem, the Prize Collecting Connected Subgraph Problem, which appears as a subproblem in routing of snow plows during snow fall. In this problem we have a set of edges in an undirected network, with edge costs and edge times. Moreover there is a time budget. The problem is to find a connected subset (corresponding to a snowplow tour) of minimal cost subject to the budget constraint. This problem can be modeled using flow constraints or introducing valid inequalities. We exemplify computations for the classical Sioux Falls Network

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

Access this chapter

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Feillet, P. Dejax, and M. Gendreaux (2004) Travelling Salesman Problems with Profits: an Overview. Laboratoire Informatique d’Avignon, to appear in Transp. Sc.

    Google Scholar 

  2. R. E. Gomory, and T.C. Hu (1961) Multi-terminal network flows. J. Soc. Indust. Appl. Math. 9 551–570.

    Article  MathSciNet  Google Scholar 

  3. A. Lucena, and M. Resende (2004) Strong lower bounds for the prize collecting Steiner problem in graphs. Discrete Applied Mathematics 141 277–294.

    Article  MathSciNet  Google Scholar 

  4. G. Razmara (2004) Snow Removal Routing — Theory and Applications. Linköping Studies in Science and Technology No. 888, Ph.D. Thesis, Dept of Mathematics, Linköping University.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Linköping University, Linköping, SE-58183, Sweden

    P. O. Lindberg & Gholamreza Razmara

Authors
  1. P. O. Lindberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gholamreza Razmara
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Warandelaan 2, 5037 AB, Tilburg, The Netherlands

    Hein Fleuren , Dick den Hertog  & Peter Kort ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lindberg, P.O., Razmara, G. (2005). The Prize Collecting Connected Subgraph Problem - A New NP-Hard Problem arising in Snow Removal Routing. In: Fleuren, H., den Hertog, D., Kort, P. (eds) Operations Research Proceedings 2004. Operations Research Proceedings, vol 2004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27679-3_45

Download citation

Publish with us

Policies and ethics

Search

Navigation