Artículo
Minimal resolutions of lattice ideals and integer linear programming
Autor/es | Briales Morales, Emilio
Campillo López. Antonio Pisón Casares, Pilar Vigneron Tenorio, Alberto |
Departamento | Universidad de Sevilla. Departamento de álgebra |
Fecha de publicación | 2003 |
Fecha de depósito | 2016-06-06 |
Publicado en |
|
Resumen | 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 ... 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. |
Agencias financiadoras | Ministerio de Ciencia y Tecnología (MCYT). España Junta de Andalucía |
Identificador del proyecto | BFM2000-1523
FQM304 |
Cita | 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. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Minimal resolutions of lattice ... | 247.0Kb | [PDF] | Ver/ | |