The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
From MaRDI portal
Publication:2238737
DOI10.1016/j.artint.2021.103561OpenAlexW3183828382MaRDI QIDQ2238737
Pavel Dvořák, Eduard Eiben, Dušan Knop, Sebastian Ordyniak, Robert Ganian
Publication date: 2 November 2021
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2021.103561
Related Items (7)
Parameterized complexity of minimum membership dominating set ⋮ Learning pseudo-backdoors for mixed integer programs ⋮ Integer programming in parameterized complexity: five miniatures ⋮ An algorithmic framework for locally constrained homomorphisms ⋮ Extended MSO model checking via small vertex integrity ⋮ Parameterized complexity of minimum membership dominating set ⋮ Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- On the computational complexity of vertex integrity and component order connectivity
- Backdoors into heterogeneous classes of SAT and CSP
- Mixed integer linear programming in process scheduling: modeling, algorithms, and applications
- Nonlinear discrete optimization. An algorithmic theory
- An application of simultaneous diophantine approximation in combinatorial optimization
- Decomposition of test sets in stochastic integer programming
- The complexity landscape of decompositional parameters for ILP
- Two-dimensional packing problems: a survey
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- \(n\)-fold integer programming in cubic time
- Combinatorial \(n\)-fold integer programming and applications
- Integer programming and incidence treedepth
- Scheduling meets \(n\)-fold integer programming
- Network hub location problems: The state of the art
- Parametrized complexity theory.
- Backdoors to Satisfaction
- Integer Programming with a Fixed Number of Variables
- A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity
- A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs
- Graph Layout Problems Parameterized by Vertex Cover
- Minkowski's Convex Body Theorem and Integer Programming
- On the complexity of integer programming
- Faster Algorithms for Integer Programs with Block Structure
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- About the Complexity of Two-Stage Stochastic IPs
- Parameterized Algorithms
- On a Problem of Sidon in Additive Number Theory, and on some Related Problems
- On Block-Structured Integer Programming and Its Applications
- Proofs from THE BOOK
This page was built for publication: The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
