Pages that link to "Item:Q3057102"
From MaRDI portal
The following pages link to On the cycle polytope of a directed graph and its relaxations (Q3057102):
Displaying 10 items.
- Doubly stochastic matrices and dicycle covers and packings in Eulerian digraphs (Q1816947) (← links)
- On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope (Q1906776) (← links)
- On some cyclic connectivity properties of directed graphs (examples and problems) (Q2714234) (← links)
- An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs (Q2826672) (← links)
- On the cycle polytope of a directed graph (Q4509381) (← links)
- Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set (Q4915192) (← links)
- Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
- The feasible region for consecutive patterns of permutations is a cycle polytope (Q5918948) (← links)
- Cycle selections (Q6041827) (← links)
- Cycle algebras and polytopes of matroids (Q6199040) (← links)
