On the number of corner cuts
DOI10.1016/S0196-8858(02)00014-3zbMATH Open1016.52004MaRDI QIDQ1865258FDOQ1865258
Authors: Uli Wagner
Publication date: 26 March 2003
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Recommendations
Enumerative combinatorics (05A99) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computational aspects related to convexity (52B55) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
Cited In (10)
- The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases.
- Cutting corners with spheres in \(d\)-dimensions
- Betti numbers of polynomial hierarchical models for experimental designs
- Approximation of corner polyhedra with families of intersection cuts
- Minimal average degree aberration and the state polytope for experimental designs
- Corner cutting systems
- Cutting Corners by Circles and Spheres
- On the number of shredders
- Triangular partitions: enumeration, structure, and generation
- Corner cuts and their polytopes
This page was built for publication: On the number of corner cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865258)