Journal ArticleOPEN ACCESS

Minimal Resolutions of Lattice Ideals and Integer Linear Programming

Revista Matematica Iberoamericana (2003) 19(2) 287-306
DOI: 10.4171/RMI/347
2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Briales-Morales, E., Campillo-López, A., Pisón-Casares, P., & Vigneron-Tenorio, A. (2003). Minimal Resolutions of Lattice Ideals and Integer Linear Programming. Revista Matematica Iberoamericana, 19(2), 287–306. https://doi.org/10.4171/RMI/347

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free