The following pages link to (Q4263727):
Displaying 23 items.
- On integer programming with bounded determinants (Q315478) (← links)
- The width and integer optimization on simplices with bounded minors of the constraint matrices (Q315480) (← links)
- Convex normality of rational polytopes with long edges (Q411736) (← links)
- FPT-algorithms for some problems related to integer programming (Q1752617) (← links)
- On the maximal width of empty lattice simplices (Q1964652) (← links)
- Minimal polygons with fixed lattice width (Q2003728) (← links)
- A local maximizer for lattice width of 3-dimensional hollow bodies (Q2028093) (← links)
- Gorenstein polytopes with trinomial \(h^*\)-polynomials (Q2042131) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
- Lattice-free simplices with lattice width \(2d - o(d)\) (Q2164720) (← links)
- On lattice-free orbit polytopes (Q2256587) (← links)
- On the rational polytopes with Chvátal rank 1 (Q2288183) (← links)
- Elementary moves on lattice polytopes (Q2299641) (← links)
- FPT-algorithm for computing the width of a simplex given by a convex hull (Q2314204) (← links)
- About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces (Q2403743) (← links)
- Unimodular triangulations of dilated 3-polytopes (Q2930864) (← links)
- The finiteness threshold width of lattice polytopes (Q3389399) (← links)
- The diameter of lattice zonotopes (Q5113413) (← links)
- Hollow polytopes of large width (Q5210954) (← links)
- The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point (Q5265218) (← links)
- The complete classification of empty lattice 4-simplices (Q5916272) (← links)
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)
