On the directed cut cone and polytope

David Avis and Conor Meagher ()
Additional contact information
David Avis: Kyoto University
Conor Meagher: McGill University

Journal of Combinatorial Optimization, 2016, vol. 31, issue 4, No 22, 1685-1708

Abstract: Abstract In this paper we study the directed cut cone and polytope which are the positive hull and convex hull of all directed cut vectors of a complete directed graph, respectively. We present results on the polyhedral structure of these polyhedra. A relation between directed cut polyhedra and undirected cut polyhedra is established that provides families of facet defining inequalities for directed cut polyhedra from those known for undirected cut polyhedra.

Keywords: Combinatorial optimization; Cut polytope; Directed cut polytope (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9863-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:31:y:2016:i:4:d:10.1007_s10878-015-9863-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9863-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().