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.
|Title of host publication||Treewidth, Kernels, and Algorithms|
|Subtitle of host publication||Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday|
|Place of Publication||Cham|
|Number of pages||11|
|Publication status||Published - 2020|
|Series||Lecture Notes in Computer Science|
- c00 - Mathematical and Quantitative Methods: General
- c60 - "Mathematical Methods; Programming Models; Mathematical and Simulation Modeling: General"
- Integer programming