Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs

DOI10.1007/978-3-030-42071-0_7OpenAlexW3019969622MaRDI QIDQ5042451

Alexander Grigoriev

Publication date: 19 October 2022

Published in: Treewidth, Kernels, and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-42071-0_7

zbMATH Keywords

integer programmingtreewidthpathwidth

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (1)

On integer linear programs for treewidth based on perfect elimination orderings

Uses Software

• ComputeTW

Cites Work

• Treewidth computations. II. Lower bounds
• Flow metrics
• Treewidth computations. I: Upper bounds
• A note on optimal area algorithms for upward drawings of binary trees
• A branch-and-price-and-cut method for computing an optimal bramble
• Multimodal optimization by means of evolutionary algorithms
• New Approximation Techniques for Some Linear Ordering Problems

This page was built for publication: Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs