Parameterized algorithms for block-structured integer programs with large entries
From MaRDI portal
Cites work
- \(N\)-fold integer programming
- \(n\)-fold integer programming in cubic time
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- 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
- Block-structured integer programming: can we parameterize without the largest coefficient?
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
- Collapsing the tower -- on the complexity of multistage stochastic IPs
- Combinatorial \(n\)-fold integer programming and applications
- Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines
- Covering a tree with rooted subtrees -- parameterized and approximation algorithms
- Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity
- Elementare Theorie der konvexen Polyeder.
- Empowering the configuration-IP: new PTAS results for scheduling with setup times
- Faster Algorithms for Integer Programs with Block Structure
- Feasibility of integer knapsacks
- Finiteness theorems in stochastic integer programming
- FPT algorithms for a special block-structured integer program with applications in scheduling
- From approximate to exact integer programming
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems
- High-multiplicity \(N\)-fold IP via configuration LP
- scientific article; zbMATH DE number 7651172 (Why is no real title available?)
- scientific article; zbMATH DE number 7788439 (Why is no real title available?)
- Integer programming in parameterized complexity: five miniatures
- Integer Programming with a Fixed Number of Variables
- Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
- Minimal solutions of linear diophantine systems : bounds and algorithms
- Minkowski's Convex Body Theorem and Integer Programming
- Near-linear time algorithm for n-fold ILPs via color coding
- Parameterized algorithms for block-structured integer programs with large entries
- Parameterized and approximation results for scheduling with a low rank processing time matrix
- Parameterized complexity of configuration integer programs
- Parametric integer programming in fixed dimension
- Scheduling kernels via configuration LP
- Scheduling meets n-fold integer programming
- The Computational Complexity of Simultaneous Diophantine Approximation Problems
- The double exponential runtime is tight for 2-stage stochastic ILPs
- The subspace flatness conjecture and faster integer programming
- Tight complexity lower bounds for integer linear programming with few constraints
- Two‐stage stochastic integer programming: a survey
- Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt.
This page was built for publication: Parameterized algorithms for block-structured integer programs with large entries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912586)
