Pages that link to "Item:Q2581319"
From MaRDI portal
The following pages link to On cycles and the stable multi-set polytope (Q2581319):
Displaying 14 items.
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts (Q834596) (← links)
- Wheel inequalities for stable set polytopes (Q1373764) (← links)
- Separating multi-oddity constrained shortest circuits over the polytope of stable multisets. (Q1417599) (← links)
- A construction for periodically-cyclic Gale \(2m\)-polytopes (Q1591748) (← links)
- On subdivision posets of cyclic polytopes (Q1964650) (← links)
- A smaller extended formulation for the odd cycle inequalities of the stable set polytope (Q1983107) (← links)
- Stable set polytopes in a higher dimensional space (Q2722326) (← links)
- Polyhedral sets and integer rounding (Q2741357) (← links)
- A Semiring on Convex Polygons and Zero-Sum Cycle Problems (Q3495676) (← links)
- Stable Set Polytopes for a Class of Circulant Graphs (Q4702296) (← links)
- Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles (Q5041738) (← links)
- Virtual private network design over the first Chvátal closure (Q5501875) (← links)
- An extended formulation for the 1‐wheel inequalities of the stable set polytope (Q6068534) (← links)
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)
