Pages that link to "Item:Q1196686"
From MaRDI portal
The following pages link to Lattice translates of a polytope and the Frobenius problem (Q1196686):
Displaying 46 items.
- Formulae for the Frobenius number in three variables (Q311484) (← links)
- Testing additive integrality gaps (Q378120) (← links)
- An enumeration algorithm for all integers nonrepresentable by some positive integers (Q477659) (← links)
- Parametric integer programming algorithm for bilevel mixed integer programs (Q711715) (← links)
- Geometric proof of Rødseth's formula for Frobenius numbers (Q741994) (← links)
- An optimal lower bound for the Frobenius problem (Q868899) (← links)
- Integer matrices, sublattices of \(\mathbb Z^m\), and Frobenius numbers (Q889030) (← links)
- Bounds on the size of branch-and-bound proofs for integer knapsacks (Q924879) (← links)
- The asymptotic distribution of Frobenius numbers (Q977169) (← links)
- Normal toric ideals of low codimension (Q1017682) (← links)
- A relation between the knapsack and group knapsack problems (Q1270786) (← links)
- An application of an optimal behaviour of the greedy solution in number theory (Q1321639) (← links)
- Test sets for integer programs (Q1365062) (← links)
- Commutative algebra of generalised Frobenius numbers (Q1726039) (← links)
- On two-way nondeterministic finite automata with one reversal-bounded counter (Q1763701) (← links)
- On the lattice programming gap of the group problems (Q1785637) (← links)
- The Frobenius problem, rational polytopes, and Fourier-Dedekind sums (Q1864844) (← links)
- Complexity of the Frobenius problem (Q1912748) (← links)
- LLL-reduction for integer knapsacks (Q1928499) (← links)
- Integer points in knapsack polytopes and \(s\)-covering radius (Q1953532) (← links)
- The trouble with the second quantifier (Q2044549) (← links)
- The covering radius and a discrete surface area for non-hollow simplices (Q2066303) (← links)
- Computing the covering radius of a polytope with an application to lonely runners (Q2095112) (← links)
- Distances to lattice points in knapsack polyhedra (Q2191767) (← links)
- On the number of integer points in translated and expanded polyhedra (Q2227240) (← links)
- Positive semigroups and generalized Frobenius numbers over totally real number fields (Q2299251) (← links)
- On finite linear systems containing strict inequalities (Q2401512) (← links)
- On densities of lattice arrangements intersecting every \(i\)-dimensional affine subspace (Q2411827) (← links)
- Diameters of random circulant graphs (Q2439833) (← links)
- Frobenius problem and dead ends in integers (Q2483162) (← links)
- Exact and approximate results on the least size of a graph with a given degree set (Q2700608) (← links)
- The Frobenius number in the set of numerical semigroups with fixed multiplicity and genus (Q2978911) (← links)
- COMPLEXITY OF SHORT GENERATING FUNCTIONS (Q3119462) (← links)
- The Frobenius Problem and Its Generalizations (Q3533000) (← links)
- Short rational generating functions for lattice point problems (Q4419572) (← links)
- Enumerating Projections of Integer Points in Unbounded Polyhedra (Q4638995) (← links)
- Frobenius Coin-Exchange Generating Functions (Q4960436) (← links)
- Optimizing Sparsity over Lattices and Semigroups (Q5041733) (← links)
- Short Presburger Arithmetic Is Hard (Q5073520) (← links)
- The Computational Complexity of Integer Programming with Alternations (Q5108263) (← links)
- (Q5148762) (← links)
- Integer Farkas Lemma (Q5245033) (← links)
- Effective limit distribution of the Frobenius numbers (Q5259732) (← links)
- Some Experimental Results on the Frobenius Problem (Q5317273) (← links)
- A Polyhedral Frobenius Theorem with Applications to Integer Optimization (Q5499737) (← links)
- Can our coinage system be improved? (Q5860179) (← links)
