2003
DOI: 10.4171/rmi/347
|View full text |Cite
|
Sign up to set email alerts
|

Minimal Resolutions of Lattice Ideals and Integer Linear Programming

Abstract: A combinatorial description of the minimal free resolution of a lattice ideal allows us to the connection of Integer Linear Programming and Algebra. The non null reduced homology spaces of some simplicial complexes are the key. The extremal rays of the associated cone reduce the number of variables.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2010
2010
2018
2018

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 44 publications
0
1
0
Order By: Relevance
“…This graded minimal free resolution of R/I has been explored by many authors with remarkable success (see e.g. [3] and the references therein).…”
Section: Introductionmentioning
confidence: 99%
“…This graded minimal free resolution of R/I has been explored by many authors with remarkable success (see e.g. [3] and the references therein).…”
Section: Introductionmentioning
confidence: 99%