Some estimates for the number of vertices of integer polyhedra

MaRDI QIDQ3115665zbMATH OpenFDO

Authors S. I. Veselov, A. Y. Chirkov

Publication date 10 February 2012

zbMATH Keywords

integer linear programminglower boundinteger point

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Recommendations

• On integer points in polyhedra: A lower bound
• On integer points in polyhedra
• Computing the integer points of a polyhedron. II: Complexity estimates
• Counting integer points in higher-dimensional polytopes
• Publication:4714496

Cited in

(6)

• On integer points in polyhedra: A lower bound
• scientific article; zbMATH DE number 942482 (Why is no real title available?)
• The number of vertices of a Fano polytope
• Number of Vertices of the Polytope of Integer Partitions and Factorization of the Partitioned Number
• A bound, in terms of its volume, for the number of vertices of a convex polyhedron when the vertices have integer coordinates
• On the polyhedral complexity of the integer points in a hyperball

This page was built for publication: Some estimates for the number of vertices of integer polyhedra

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