Repositorio de producción científica de la Universidad de Sevilla

Minimal resolutions of lattice ideals and integer linear programming

 

Advanced Search
 
Opened Access Minimal resolutions of lattice ideals and integer linear programming
Cites

Show item statistics
Icon
Export to
Author: Briales Morales, Emilio
Campillo López. Antonio
Pisón Casares, Pilar
Vigneron Tenorio, Alberto
Department: Universidad de Sevilla. Departamento de álgebra
Date: 2003
Published in: Revista Matemática Iberoamericana, 19 (2), 287-306.
Document type: Article
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.
Cite: Briales Morales, E., Campillo López. Antonio, , Pisón Casares, P. y Vigneron Tenorio, A. (2003). Minimal resolutions of lattice ideals and integer linear programming. Revista Matemática Iberoamericana, 19 (2), 287-306.
Size: 247.0Kb
Format: PDF

URI: http://hdl.handle.net/11441/41872

DOI: 10.4171/RMI/347

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)