Rüdiger Stephan

13 papers C 3Journal 9Unranked 1
YearRankTypeTitle / Venue / Authors
2014 J jnl
Characterization of facets of the hop constrained chain polytope via dynamic programming.
Discret. Appl. Math.
Martin Grötschel, Rüdiger Stephan
2014 J jnl
On cardinality constrained polymatroids.
Discret. Appl. Math.
Jean François Maurras, Ingo Spiegelberg, Rüdiger Stephan
2012 J jnl
Solving steel mill slab design problems.
Constraints An Int. J.
Stefan Heinz, Thomas Schlechte, Rüdiger Stephan, Michael Winkler
2011 J jnl
On the cardinality constrained matroid polytope.
Networks
Jean François Maurras, Rüdiger Stephan
2011 C conf
Reducing the minimum T-cut problem to polynomial size linear programming.
CTW
Rüdiger Stephan
2010 J jnl
Cardinality constrained combinatorial optimization: Complexity and polyhedra.
Discret. Optim.
Rüdiger Stephan
2010 J jnl
On cardinality constrained cycle and path polytopes.
Math. Program.
Volker Kaibel, Rüdiger Stephan
2010 J jnl
On cardinality constrained polymatroids.
Electron. Notes Discret. Math.
Rüdiger Stephan, Ingo Spiegelberg
2009 C conf
Classification of 0/1-Facets of the Hop Constrained Path Polytope Defined on an Acyclic Digraph.
CTW
Rüdiger Stephan
2009 J jnl
Facets of the (s, t)-p-path polytope.
Discret. Appl. Math.
Rüdiger Stephan
2009 J jnl
On the cycle polytope of a directed graph and its relaxations.
Networks
Egon Balas, Rüdiger Stephan
2008 C conf
On the cardinality constrained matroid polytope.
CTW
Rüdiger Stephan
2006 — conf
On the Cycle Polytope of a Directed Graph and Its Relaxations.
OR
Egon Balas, Rüdiger Stephan