Pages that link to "Item:Q4509381"
From MaRDI portal
The following pages link to On the cycle polytope of a directed graph (Q4509381):
Displaying 19 items.
- A complete characterization of jump inequalities for the hop-constrained shortest path problem (Q528561) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- Solving the asymmetric traveling purchaser problem (Q867540) (← links)
- On cardinality constrained cycle and path polytopes (Q964176) (← links)
- Facets of the \((s,t)-p\)-path polytope (Q967368) (← links)
- On the linear description of the 3-cycle polytope (Q1600839) (← links)
- The traveling purchaser problem and its variants (Q1751767) (← links)
- The Steiner cycle polytope (Q1873013) (← links)
- Directed cycles with two chords and strong spanning directed subgraphs with few arcs (Q1907108) (← links)
- A branch-and-cut algorithm for the median-path problem (Q2490367) (← 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 and its relaxations (Q3057102) (← links)
- (Q3108620) (← links)
- Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
- (Q5419957) (← links)
- The feasible region for consecutive patterns of permutations is a cycle polytope (Q5918948) (← links)
- Facets of the \(p\)-cycle polytope (Q5946821) (← links)
- Cycle selections (Q6041827) (← links)
