Minimal resolutions of lattice ideals and integer linear programming.

  1. Briales Morales, Emilio
  2. Campillo López, Antonio
  3. Pisón-Casares, Pilar
  4. Vigneron-Tenorio, Alberto
Journal:
Revista matemática iberoamericana

ISSN: 0213-2230

Year of publication: 2003

Volume: 19

Issue: 2

Pages: 287-306

Type: Article

DOI: 10.4171/RMI/347 DIALNET GOOGLE SCHOLAR

More publications in: Revista matemática iberoamericana

Abstract

A combinatorial description of the minimal free resolution of a lattice ideal allows us to the connection of Integer Linear Programming and Al1gebra. 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.

Data source: Dialnet