2 citations · 5 across the 4 of their papers we have counts for
4 papers
An extension of disjunctive programming and its impact for compact tree formulations
Rüdiger Stephan
In the 1970's, Balas introduced the concept of disjunctive programming, which is optimization over unions of polyhedra. One main result of his theory is that, given linear descript…
On the cardinality constrained matroid polytope
Jean F. Maurras, Ruediger Stephan
Given a combinatorial optimization problem and an increasing finite sequence of natural numbers, we obtain a cardinality constrained version of by permitting only…
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…
Facets of the (s,t)-p-path polytope
Rüdiger Stephan
We give a partial description of the (s,t)-p-path polytope of a directed graph D which is the convex hull of the incidence vectors of simple directed (s,t)-paths in D of length p.…