Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs

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