crossing number;
integer linear program;
polyhedral study;
facets;
Kuratowski constraints;
D O I:
10.1137/09076965X
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
In the last years, several integer linear programming (ILP) formulations for the crossing number problem arose. While they all contain a common conceptual core, the properties of the corresponding polytopes have never been investigated. In this paper, we formally establish the crossing number polytope and show several facet-defining constraint classes.