An introduction to empty lattice simplices

DOI10.1007/3-540-48777-8_30MaRDI QIDQ4263727zbMATH OpenFDO

Authors András Sebö

Publication date 12 December 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48777-8_30

zbMATH Keywords

combinatorial problemsinteger programmingknapsack or partition lattice simplexpolynomial algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On the maximal width of empty lattice simplices
• Classification of empty lattice 4-simplices of width larger than two
• Classification of empty lattice 4-simplices of width larger than 2
• On the width of lattice-free simplices

Cited in

(34)

• Classification of empty lattice 4-simplices of width larger than 2
• FPT-algorithms for some problems related to integer programming
• On the maximal width of empty lattice simplices
• Minimal polygons with fixed lattice width
• A local maximizer for lattice width of 3-dimensional hollow bodies
• Gorenstein polytopes with trinomial \(h^*\)-polynomials
• A generalization of a theorem of White
• An FPTAS for the -modular multidimensional knapsack problem
• On lattice point counting in -modular polyhedra
• Lattice-free simplices with lattice width \(2d - o(d)\)
• Empty monochromatic simplices
• On lattice-free orbit polytopes
• On the rational polytopes with Chvátal rank 1
• Elementary moves on lattice polytopes
• FPT-algorithm for computing the width of a simplex given by a convex hull
• About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces
• Unimodular triangulations of dilated 3-polytopes
• scientific article; zbMATH DE number 2186838 (Why is no real title available?)
• On empty lattice simplices in dimension 4
• On integer programming with bounded determinants
• The width and integer optimization on simplices with bounded minors of the constraint matrices
• The finiteness threshold width of lattice polytopes
• Convex normality of rational polytopes with long edges
• On the width of lattice-free simplices
• Classification of empty lattice 4-simplices of width larger than two
• The diameter of lattice zonotopes
• Hollow polytopes of large width
• White's theorem. An exposition of White's characterization of empty lattice tetrahedra
• The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point
• Enumeration and unimodular equivalence of empty delta-modular simplices
• On -modular integer linear problems in the canonical form and equivalent problems
• The cyclicity rank of empty lattice simplices
• Empty simplices of large width
• On lattice diameter segments: algorithms and structure

This page was built for publication: An introduction to empty lattice simplices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263727)