Skip to main content
SpringerLink
Log in

Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs

  • Chapter
  • First Online:
Treewidth, Kernels, and Algorithms

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

Abstract

We survey a number of integer programming formulations for the pathwidth and treewidth problems. The attempts to find good formulations for the problems span the period of 15 years, yet without any true success. Nevertheless, some formulations provide potentially useful frameworks for attacking these notorious problems. Some others are just curious and interesting fruits of mathematical imagination.

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

References

  1. Bodlaender, H.L.:Personal communications (2004)

    Google Scholar 

  2. Bodlaender, H.L., Koster, A.M.C.A.: Treewidth computations I. Upper bounds. Inf. Comput. 208(3), 259–275 (2010). https://doi.org/10.1016/j.ic.2009.03.008

    Article  MathSciNet  MATH  Google Scholar 

  3. Bodlaender, H.L., Koster, A.M.C.A.: Treewidth computations II. Lower bounds. Inf. Comput. 209(7), 1103–1119 (2011). https://doi.org/10.1016/j.ic.2011.04.003

    Article  MathSciNet  MATH  Google Scholar 

  4. Bornstein, C.F., Vempala, S.: Flow metrics. Theor. Comput. Sci. 321(1), 13–24 (2004). https://doi.org/10.1016/j.tcs.2003.05.003

    Article  MathSciNet  MATH  Google Scholar 

  5. Crescenzi, P., Di Battista, G., Piperno, A.: A note on optimal area algorithms for upward drawings of binary trees. Comput. Geom. 2, 187–200 (1992). https://doi.org/10.1016/0925-7721(92)90021-J

    Article  MathSciNet  MATH  Google Scholar 

  6. Goldberg, A.V.: Finding a maximum density subgraph. Technical report, UCB/CSD-84-171. EECS Department, University of California, Berkeley (1984). http://www2.eecs.berkeley.edu/Pubs/TechRpts/1984/5956.html

  7. Margulies, S., Ma, J., Hicks, I.V.: The Cunningham-Geelen method in practice: branch-decompositions and integer programming. INFORMS J. Comput. 25(4), 599–610 (2013). https://doi.org/10.1287/ijoc.1120.0524

    Article  MathSciNet  Google Scholar 

  8. Preuss, M.: Multimodal Optimization by Means of Evolutionary Algorithms. Natural Computing Series. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-07407-8

    Book  MATH  Google Scholar 

  9. Rao, S., Richa, A.W.: New approximation techniques for some linear ordering problems. SIAM J. Comput. 34(2), 388–404 (2004). https://doi.org/10.1137/S0097539702413197

    Article  MathSciNet  MATH  Google Scholar 

  10. Sonuc, S.B., Smith, J.C., Hicks, I.V.: A branch-and-price-and-cut method for computing an optimal bramble. Discrete Optim. 18, 168–188 (2015). https://doi.org/10.1016/j.disopt.2015.09.005

    Article  MathSciNet  MATH  Google Scholar 

  11. Usotskaya, N.: Exploiting geometric properties in combinatorial optimization. Ph.D. thesis, Maastricht University, Maastricht, The Netherlands (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Maastricht University School of Business and Economics, Maastricht, The Netherlands

    Alexander Grigoriev

Authors
  1. Alexander Grigoriev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander Grigoriev .

Editor information

Editors and Affiliations

  1. University of Bergen, Bergen, Norway

    Fedor V. Fomin

  2. Humboldt-University, Berlin, Germany

    Stefan Kratsch

  3. Utrecht University, Utrecht, The Netherlands

    Erik Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Grigoriev, A. (2020). Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs. In: Fomin, F.V., Kratsch, S., van Leeuwen, E.J. (eds) Treewidth, Kernels, and Algorithms. Lecture Notes in Computer Science(), vol 12160. Springer, Cham. https://doi.org/10.1007/978-3-030-42071-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-42071-0_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-42070-3

  • Online ISBN: 978-3-030-42071-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation