Article ID Journal Published Year Pages File Type
6861193 Journal of Symbolic Computation 2018 18 Pages PDF
Abstract
Then we shortly consider generalizations to the case of lattice Delaunay simplices of index higher than 1. The case of hypermetrics on graphs is also considered and we show how one can obtain new valid inequalities for the cut-polytope of a graph. We then consider shortly the case of infinite hypermetrics.
Related Topics
Physical Sciences and Engineering Computer Science Artificial Intelligence
Authors
, ,