On the lattice programming gap of the group problems
From MaRDI portal
Publication:1785637
DOI10.1016/j.orl.2015.01.008zbMath1408.90185arXiv1404.6967OpenAlexW1969573257MaRDI QIDQ1785637
Publication date: 1 October 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.6967
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) The Frobenius problem (11D07)
Related Items
On densities of lattice arrangements intersecting every \(i\)-dimensional affine subspace ⋮ Distances to lattice points in knapsack polyhedra
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Testing additive integrality gaps
- Non-standard approaches to integer programming
- An optimal lower bound for the Frobenius problem
- Frobenius problem and the covering radius of a lattice
- The asymptotic distribution of Frobenius numbers
- Lattice translates of a polytope and the Frobenius problem
- Geometric algorithms and combinatorial optimization
- Gomory integer programs
- Cyclic group and knapsack facets
- Complexity of the Frobenius problem
- Diameters of random circulant graphs
- Computing the integer programming gap
- Some polyhedra related to combinatorial problems
- Feasibility of Integer Knapsacks
- On the limit distribution of Frobenius numbers
- The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- Extensions of the Group Theoretic Approach in Integer Programming
- Sur la densité des réseaux de domaines convexes
This page was built for publication: On the lattice programming gap of the group problems
