Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

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.
Original languageEnglish
Title of host publicationTreewidth, Kernels, and Algorithms
Subtitle of host publicationEssays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday
Place of PublicationCham
PublisherSpringer
Pages78-88
Number of pages11
ISBN (Electronic)978-3-030-42071-0
ISBN (Print)978-3-030-42070-3
DOIs
Publication statusPublished - 2020

Publication series

SeriesLecture Notes in Computer Science
Volume12160
ISSN0302-9743

JEL classifications

  • c00 - Mathematical and Quantitative Methods: General
  • c60 - "Mathematical Methods; Programming Models; Mathematical and Simulation Modeling: General"

Keywords

  • Treewidth
  • Pathwidth
  • Integer programming

Cite this