Some estimates for the number of vertices of integer polyhedra

zbMATH Open1249.52015MaRDI QIDQ3115665FDOQ3115665

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

Publication date: 10 February 2012

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

zbMATH Keywords

integer linear programminglower boundinteger point

Mathematics Subject Classification ID

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

Cited In (6)

• On the polyhedral complexity of the integer points in a hyperball
• The number of vertices of a Fano polytope
• Title not available (Why is that?)
• A bound, in terms of its volume, for the number of vertices of a convex polyhedron when the vertices have integer coordinates
• On integer points in polyhedra: A lower bound
• Number of Vertices of the Polytope of Integer Partitions and Factorization of the Partitioned Number

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)