Truncated Markov bases and Gr\"obner bases for Integer Programming
From MaRDI portal
Publication:6478482
arXivmath/0612615MaRDI QIDQ6478482FDOQ6478482
Authors: Peter N. Malkin 
Publication date: 20 December 2006
Abstract: We 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.
This page was built for publication: Truncated Markov bases and Gr\"obner bases for Integer Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6478482)
