Maximal lattice free bodies, test sets and the Frobenius problem
| dc.creator | Jensen, Anders | |
| dc.creator | Lauritzen, Niels | |
| dc.creator | Roune, Bjarke | |
| dc.date | 2007-05-30 | |
| dc.date | 2007-05-30 | |
| dc.date.accessioned | 2026-07-07T08:09:25Z | |
| dc.date.available | 2026-07-07T08:09:25Z | |
| dc.description | Maximal lattice free bodies are maximal polytopes without interior integral points. Scarf initiated the study of maximal lattice free bodies relative to the facet normals in a fixed matrix. In this paper we give an efficient algorithm for computing the maximal lattice free bodies of an integral matrix A. An important ingredient is a test set for a certain integer program associated with A. This test set may be computed using algebraic methods. As an application we generalize the Scarf-Shallcross algorithm for the three-dimensional Frobenius problem to arbitrary dimension. In this context our method is inspired by the novel algorithm by Einstein, Lichtblau, Strzebonski and Wagon and the Groebner basis approach by Roune. | |
| dc.identifier | https://arxiv.org/abs/0705.4439 | |
| dc.identifier | http://arxiv.org/abs/0705.4439 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/131536 | |
| dc.subject | Combinatorics | |
| dc.subject | Optimization and Control | |
| dc.title | Maximal lattice free bodies, test sets and the Frobenius problem | |
| dc.type | text |