On cardinality constrained cycle and path polytopes

Volker Kaibel, Ruediger Stephan

Given a directed graph D = (N, A) and a sequence of positive integers 1 <= c_1 < c_2 < ... < c_m <= |N|, we consider those path and cycle polytopes that are defined as the convex h…