Research map / Learning theory and algorithms / Combinatorial and search optimization
Going Beyond Primal Treewidth for (M)ILP
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- The Complexity Landscape of Decompositional Parameters for ILP (AAAI 2016 · similarity 0.93)
- Parameterized Algorithms for MILPs with Small Treedepth (AAAI 2021 · similarity 0.93)
- MILP-StuDio: MILP Instance Generation via Block Structure Decomposition (NeurIPS 2024 · similarity 0.86)
- On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? (AAAI 2024 · similarity 0.85)
- ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance Generation (ICML 2024 · similarity 0.85)
- SymILO: A Symmetry-Aware Learning Framework for Integer Linear Optimization (NeurIPS 2024 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.