New limits of treewidth-based tractability in optimization-Reference-Cited by-同舟云学术

New limits of treewidth-based tractability in optimization

Published:2020-09-15 Issue: Volume: Page:
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Math. Program.

Author:

Faenza Yuri,Muñoz Gonzalo^ORCID,Pokutta Sebastian

Funder

National Science Foundation

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

https://link.springer.com/content/pdf/10.1007/s10107-020-01563-5.pdf

Reference65 articles.

1. Aboulker, P., Fiorini, S., Huynh, T., Macchia, M., Seif, J.: Extension complexity of the correlation polytope. Oper. Res. Lett. 47(1), 47–51 (2019)

2. Arnborg, S.: Efficient algorithms for combinatorial problems on graphs with bounded decomposability. A survey. BIT Numer. Math. 25, 2–23 (1985)

3. Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems on graphs embedded in k-trees. Tech. Rep. TRITA-NA-8404, The Royal Institute of Technology, Stockholm (1984)

4. Arnborg, S., Corneil, D., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebr. Discret. Methods 8(2), 277–284 (1987)

5. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308–340 (1991)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Learning for Spatial Branching: An Algorithm Selection Approach;INFORMS Journal on Computing;2023-09

2. Worst-case analysis of clique MIPs;Mathematical Programming;2021-09-23

3. Traceability Technology Adoption in Supply Chain Networks;SSRN Electronic Journal;2021