High-multiplicity $N$-fold IP via configuration LP

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory
$N$-fold integer programming
Nonlinear discrete optimization. An algorithmic theory
The modified integer round-up property of the one-dimensional cutting stock problem
Bin packing can be solved within 1+epsilon in linear time
Approximation schemes for scheduling on parallel machines
Geometric algorithms and combinatorial optimization.
To the Steinitz lemma in coordinate form
Partitioning mathematical programs for parallel solution
Combinatorial $n$-fold integer programming and applications
Graver basis and proximity techniques for block-structured separable convex integer minimization problems
Scheduling meets $n$-fold integer programming
Huge multiway table problems
Automatic Dantzig-Wolfe reformulation of mixed integer programs
Parameterized complexity of configuration integer programs
Parallel Machine Scheduling by Column Generation
A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths
Egyptian Fractions
A Linear Programming Approach to the Cutting-Stock Problem
The Traveling Salesman Problem with Many Visits to Few Cities
Reformulation and Decomposition of Integer Programs
A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
Decomposing Matrices into Blocks
Permuting Sparse Rectangular Matrices into Block-Diagonal Form
Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization
Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
Faster Algorithms for Integer Programs with Block Structure
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
On Integer Programming and Convolution.
Structure Detection in Mixed-Integer Programs
Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding
Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms
Convex separable optimization is not much harder than linear optimization

High-multiplicity \(N\)-fold IP via configuration LP