Lattice translates of a polytope and the Frobenius problem
From MaRDI portal
Publication:1196686
DOI10.1007/BF01204720zbMath0753.11013OpenAlexW2092017668WikidataQ59448324 ScholiaQ59448324MaRDI QIDQ1196686
Publication date: 16 January 1993
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01204720
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10) Number-theoretic algorithms; complexity (11Y16) Lattice packing and covering (number-theoretic aspects) (11H31) Linear Diophantine equations (11D04)
Related Items
Optimizing Sparsity over Lattices and Semigroups, Formulae for the Frobenius number in three variables, Test sets for integer programs, Short Presburger Arithmetic Is Hard, Some Experimental Results on the Frobenius Problem, Complexity of the Frobenius problem, An optimal lower bound for the Frobenius problem, On finite linear systems containing strict inequalities, Testing additive integrality gaps, On densities of lattice arrangements intersecting every \(i\)-dimensional affine subspace, LLL-reduction for integer knapsacks, Integer matrices, sublattices of \(\mathbb Z^m\), and Frobenius numbers, Distances to lattice points in knapsack polyhedra, The Computational Complexity of Integer Programming with Alternations, The generalized Frobenius problem via restricted partition functions, Integer points in knapsack polytopes and \(s\)-covering radius, Exact and approximate results on the least size of a graph with a given degree set, Diameters of random circulant graphs, The Frobenius number in the set of numerical semigroups with fixed multiplicity and genus, The Frobenius Problem and Its Generalizations, Bounds on the size of branch-and-bound proofs for integer knapsacks, Commutative algebra of generalised Frobenius numbers, An enumeration algorithm for all integers nonrepresentable by some positive integers, On the number of integer points in translated and expanded polyhedra, Enumerating Projections of Integer Points in Unbounded Polyhedra, Frobenius problem and dead ends in integers, On two-way nondeterministic finite automata with one reversal-bounded counter, The asymptotic distribution of Frobenius numbers, Parametric integer programming algorithm for bilevel mixed integer programs, Short rational generating functions for lattice point problems, On the lattice programming gap of the group problems, Frobenius Coin-Exchange Generating Functions, The trouble with the second quantifier, Geometric proof of Rødseth's formula for Frobenius numbers, Positive semigroups and generalized Frobenius numbers over totally real number fields, Normal toric ideals of low codimension, A relation between the knapsack and group knapsack problems, The covering radius and a discrete surface area for non-hollow simplices, Integer Farkas Lemma, A Polyhedral Frobenius Theorem with Applications to Integer Optimization, Unnamed Item, COMPLEXITY OF SHORT GENERATING FUNCTIONS, Computing the covering radius of a polytope with an application to lonely runners, Can our coinage system be improved?, Effective limit distribution of the Frobenius numbers, The Frobenius problem, rational polytopes, and Fourier-Dedekind sums, An application of an optimal behaviour of the greedy solution in number theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An application of Gomory cuts in number theory
- Improved upper bounds on Shellsort
- The diophantine problem of Frobenius: A close bound
- Integer Programming with a Fixed Number of Variables
- A new upper bound for Shellsort
- Minkowski's Convex Body Theorem and Integer Programming
- Solution to a linear diophantine equation for nonnegative integers
- Sensitivity theorems in integer linear programming
- On the linear diophantine problem of Frobenius.
- On a linear Diophantine problem of Frobenius.
- An observation on the structure of production sets with indivisibilities
