Rüdiger Stephan

According to our database, Rüdiger Stephan authored at least 12 papers between 2008 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2014

On cardinality constrained polymatroids.

Jean François Maurras, Ingo Spiegelberg, Rüdiger Stephan

Discret. Appl. Math., 2014

Characterization of facets of the hop constrained chain polytope via dynamic programming.

Martin Grötschel, Rüdiger Stephan

Discret. Appl. Math., 2014

2012

Solving steel mill slab design problems.

Stefan Heinz, Thomas Schlechte, Rüdiger Stephan, Michael Winkler

Constraints An Int. J., 2012

2011

On the cardinality constrained matroid polytope.

Jean François Maurras, Rüdiger Stephan

Networks, 2011

Reducing the minimum T-cut problem to polynomial size linear programming.

Rüdiger Stephan

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010

On cardinality constrained cycle and path polytopes.

Volker Kaibel, Rüdiger Stephan

Math. Program., 2010

On cardinality constrained polymatroids.

Rüdiger Stephan, Ingo Spiegelberg

Electron. Notes Discret. Math., 2010

Cardinality constrained combinatorial optimization: Complexity and polyhedra.

Rüdiger Stephan

Discret. Optim., 2010

2009

On the cycle polytope of a directed graph and its relaxations.

Egon Balas, Rüdiger Stephan

Networks, 2009

Facets of the (s, t)-p-path polytope.

Rüdiger Stephan

Discret. Appl. Math., 2009

Classification of 0/1-Facets of the Hop Constrained Path Polytope Defined on an Acyclic Digraph.

Rüdiger Stephan

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

On the cardinality constrained matroid polytope.

Rüdiger Stephan

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008