Solving 4-block integer linear programs faster using affine decompositions of the right-hand sides
From MaRDI portal
Cites work
- A colorful Steinitz lemma with application to block-structured integer programs
- A parameterized linear formulation of the integer hull
- 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 Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- About the complexity of two-stage stochastic IPs
- An application of simultaneous diophantine approximation in combinatorial optimization
- Block-structured integer programming: can we parameterize without the largest coefficient?
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Convex Polytopes
- Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity
- Empowering the configuration-IP: new PTAS results for scheduling with setup times
- Faster Algorithms for Integer Programs with Block Structure
- Forall-exist statements in pseudopolynomial time
- FPT algorithms for a special block-structured integer program with applications in scheduling
- Graph Layout Problems Parameterized by Vertex Cover
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- 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
- Minimal solutions of linear diophantine systems : bounds and algorithms
- Minkowski's Convex Body Theorem and Integer Programming
- On the Zone Theorem for Hyperplane Arrangements
- Parameterized algorithms for block-structured integer programs with large entries
- Parameterized complexity of distance labeling and uniform channel assignment problems
- Scheduling meets n-fold integer programming
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
- Voting schemes for which it can be difficult to tell who won the election
This page was built for publication: Solving 4-block integer linear programs faster using affine decompositions of the right-hand sides
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349455)
