Ir al contenido

Documat

Resumen de Minimal resolutions of lattice ideals and integer linear programming.

Emilio Briales Morales Árbol académico, Antonio Campillo López Árbol académico, Pilar Pisón Casares Árbol académico, Alberto Vigneron-Tenorio Árbol académico

  • 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.

Fundación Dialnet

Mi Documat