On the number of vertices in integer linear programming problems

Simple item page
dc.creatorZolotykh, Nikolai Yu.
dc.date2006-11-12
dc.date.accessioned2026-07-07T07:32:48Z
dc.date.available2026-07-07T07:32:48Z
dc.descriptionWe give a survey of work on the number of vertices of the convex hull of integer points defined by the system of linear inequalities. Also, we present our improvement of some of these.
dc.description12 pages
dc.identifierhttps://arxiv.org/abs/math/0611356
dc.identifierhttp://arxiv.org/abs/math/0611356
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/119243
dc.subjectCombinatorics
dc.subject05A16; 90C10; 90C57
dc.titleOn the number of vertices in integer linear programming problems
dc.typetext

Files

Collections

arXiv