On the Cycle Polytope of a Directed Graph and Its Relaxations

DOI10.1007/978-3-540-69995-8_34zbMath1209.05104OpenAlexW2399831189MaRDI QIDQ5391763

Rüdiger Stephan, Egon Balas

Publication date: 7 April 2011

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69995-8_34

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

On cardinality constrained cycle and path polytopes

This page was built for publication: On the Cycle Polytope of a Directed Graph and Its Relaxations