Fast integer programming in fixed dimension
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5165610
- Las Vegas algorithms for linear and integer programming when the dimension is small
- An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
- scientific article; zbMATH DE number 1757949
- Linear Programming in Linear Time When the Dimension Is Fixed
Cited in
(39)- A quantitative Doignon-Bell-Scarf theorem
- A note on non-degenerate integer programs with small sub-determinants
- A linear algorithm for integer programming in the plane
- On the complexity of computing Kronecker coefficients
- Techniques and results on approximation algorithms for packing circles
- FPT-algorithm for computing the width of a simplex given by a convex hull
- Minimum dimensional Hamming embeddings
- On the complexity of quasiconvex integer minimization problem
- On minimum integer representations of weighted games
- An asymptotically exact algorithm for the high-multiplicity bin packing problem
- Approximation algorithms for a virtual machine allocation problem with finite types
- Fair and efficient allocation with few agent types, few item types, or small value levels
- On polynomial kernels for sparse integer linear programs
- Conjugacy and other properties of one-relator groups
- Optimal edge-coloring with edge rate constraints
- A fixed point iterative approach to integer programming and its distributed computation
- Helly’s theorem: New variations and applications
- Polynomial-time approximation schemes for circle and other packing problems
- Property testing for bounded degree databases
- High-multiplicity scheduling on one machine with forbidden start and completion times
- scientific article; zbMATH DE number 1757949 (Why is no real title available?)
- Local testing of lattices
- Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization
- Enumerating projections of integer points in unbounded polyhedra
- A randomized sieving algorithm for approximate integer programming
- Faster Algorithms for Integer Programs with Block Structure
- Sparse integer programming is FPT
- Short Presburger Arithmetic Is Hard
- Algorithms and Computation
- scientific article; zbMATH DE number 5165610 (Why is no real title available?)
- Integer programming in an algebraic computation model
- Optimizing low dimensional functions over the integers
- On Integer Programming, Discrepancy, and Convolution
- Enumeration and unimodular equivalence of empty delta-modular simplices
- Reconfiguration of multisets with applications to bin packing
- Reconfiguration of multisets with applications to bin packing
- Vectors in a box
- On the bin packing problem with a fixed number of object weights
- Optimal routing in double loop networks
This page was built for publication: Fast integer programming in fixed dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897246)
