Skip to main content
SpringerLink
Log in

Connections in Networks: A Hybrid Approach

  • Conference paper
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5015))

Abstract

This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which drastically reduces the cost of testing for infeasibility and also helps prune the search space for MIP-based optimization. Overall, this provides a much more scalable solution than simply optimizing a MIP model of the problem with Cplex. We report results for semi-structured lattice instances as well as on real data used for the construction of a wildlife corridor for grizzly bears in the Northern Rockies region.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. CERI. Grizzly bear habitat sustainability data, Craighead Environmental Research Institute, Bozeman, MT (2007)

    Google Scholar 

  2. Conrad, J., Gomes, C.P., van Hoeve, W.-J., Sabharwal, A., Suter, J.: Connections in networks: Hardness of feasibility versus optimality. In: Van Hentenryck, P., Wolsey, L.A. (eds.) CPAIOR 2007. LNCS, vol. 4510, pp. 16–28. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. ILOG, SA. CPLEX 10.1 reference manual (2006)

    Google Scholar 

  4. Prömel, H.J., Steger, A.: The Steiner Tree Problem: A Tour Through Graphs, Algorithms, and Complexity. Vieweg (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Cornell University, Ithaca, NY 14853, U.S.A.

    Carla P. Gomes & Ashish Sabharwal

  2. Tepper School of Business, Carnegie Mellon Univ., Pittsburgh, PA 15213, U.S.A.

    Willem-Jan van Hoeve

Authors
  1. Carla P. Gomes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Willem-Jan van Hoeve
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ashish Sabharwal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Laurent Perron Michael A. Trick

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gomes, C.P., van Hoeve, WJ., Sabharwal, A. (2008). Connections in Networks: A Hybrid Approach. In: Perron, L., Trick, M.A. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2008. Lecture Notes in Computer Science, vol 5015. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68155-7_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68155-7_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68154-0

  • Online ISBN: 978-3-540-68155-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation