Truncated Markov bases and Gröbner bases for Integer Programming

Simple item page
dc.creatorMalkin, Peter N.
dc.date2006-12-20
dc.date.accessioned2026-07-07T07:36:23Z
dc.date.available2026-07-07T07:36:23Z
dc.descriptionWe present a new algorithm for computing a truncated Markov basis of a lattice. In general, this new algorithm is faster than existing methods. We then extend this new algorithm so that it solves the linear integer feasibility problem with promising results for equality knapsack problems. We also present a novel Groebner basis approach to solve a particular integer linear program as opposed to previous Groebner basis methods that effectively solved many different integer linear programs simultaneously. Initial results indicate that this optimisation algorithm performs better than previous Groebner basis methods.
dc.description27 pages
dc.identifierhttps://arxiv.org/abs/math/0612615
dc.identifierhttp://arxiv.org/abs/math/0612615
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/120404
dc.subjectOptimization and Control
dc.subjectCombinatorics
dc.subject90C10
dc.titleTruncated Markov bases and Gröbner bases for Integer Programming
dc.typetext

Files

Collections

arXiv