The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
From MaRDI portal
(Redirected from Publication:2238737)
Recommendations
- The complexity landscape of decompositional parameters for ILP
- Tight complexity lower bounds for integer linear programming with few constraints
- Tight complexity lower bounds for integer linear programming with few constraints
- On the path-width of integer linear programming
- On the path-width of integer linear programming
Cites work
- \(n\)-fold integer programming in cubic time
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs
- A structural approach to kernels for ILPs: treewidth and total unimodularity
- About the Complexity of Two-Stage Stochastic IPs
- Algebraic and geometric ideas in the theory of discrete optimization
- An application of simultaneous diophantine approximation in combinatorial optimization
- Backdoors into heterogeneous classes of SAT and CSP
- Backdoors to satisfaction
- Combinatorial \(n\)-fold integer programming and applications
- Covering a tree with rooted subtrees -- parameterized and approximation algorithms
- Decomposition of test sets in stochastic integer programming
- Faster Algorithms for Integer Programs with Block Structure
- Fundamentals of parameterized complexity
- Graph Layout Problems Parameterized by Vertex Cover
- Graph theory
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 1452992 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Integer programming and incidence treedepth
- Integer Programming with a Fixed Number of Variables
- Minkowski's Convex Body Theorem and Integer Programming
- Mixed integer linear programming in process scheduling: modeling, algorithms, and applications
- Network hub location problems: The state of the art
- Nonlinear discrete optimization. An algorithmic theory
- On a Problem of Sidon in Additive Number Theory, and on some Related Problems
- On Block-Structured Integer Programming and Its Applications
- On the complexity of integer programming
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- Parameterized algorithms
- Parametrized complexity theory.
- Proofs from THE BOOK
- Scheduling meets n-fold integer programming
- The complexity landscape of decompositional parameters for ILP
- Two-dimensional packing problems: a survey
Cited in
(19)- The complexity landscape of decompositional parameters for ILP
- Parameterized complexity of minimum membership dominating set
- Learning pseudo-backdoors for mixed integer programs
- Integer programming in parameterized complexity: five miniatures
- Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
- An algorithmic framework for locally constrained homomorphisms
- Parameterized complexity of minimum membership dominating set
- Extended MSO model checking via small vertex integrity
- Fault-prognosability, \(K\)-step prognosis and \(K\)-step predictive diagnosis in partially observed Petri nets by means of algebraic techniques
- Structural parameterizations of vertex integrity (best paper)
- Structural parameterizations of vertex integrity
- The complexity of optimizing atomic congestion
- Parameterized vertex integrity revisited
- Twin-width meets feedback edges and vertex integrity
- Linear layouts revisited: stacks, queues, and exact algorithms
- Solving 4-block integer linear programs faster using affine decompositions of the right-hand sides
- A brief history of parameterized algorithms for block-structured integer programs (invited talk)
- Binary k-center with missing entries: structure leads to tractability
- Parameterized algorithms for matching integer programs with additional rows and columns
This page was built for publication: The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238737)
