Pages that link to "Item:Q1100483"
From MaRDI portal
The following pages link to Matrices with the Edmonds-Johnson property (Q1100483):
Displaying 41 items.
- A branch and cut solver for the maximum stable set problem (Q491210) (← links)
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\) (Q582302) (← links)
- Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach (Q829168) (← links)
- On the feedback vertex set polytope of a series-parallel graph (Q834183) (← links)
- A note on kernels and Sperner's Lemma (Q967389) (← links)
- On matrices with the Edmonds-Johnson property (Q972620) (← links)
- Stable sets, corner polyhedra and the Chvàtal closure (Q1043240) (← links)
- Odd-\(K_{4}\)'s in stability critical graphs (Q1045088) (← links)
- On the stable set polytope of a series-parallel graph (Q1106858) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- On shortest \(T\)-joins and packing \(T\)-cuts (Q1210583) (← links)
- The maximum clique problem (Q1318271) (← links)
- Fractional and integral colourings (Q1363414) (← links)
- Rational and integral \(k\)-regular matrices. (Q1420582) (← links)
- Coloring graphs with no \(\text{odd-}K_4\) (Q1584207) (← links)
- On matrices with the Edmonds-Johnson property arising from bidirected graphs (Q1745732) (← links)
- Fractional matroid matchings (Q1812954) (← links)
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts (Q1814791) (← links)
- Note on a conjecture of Toft (Q1900186) (← links)
- Stability critical graphs and ranks facets of the stable set polytope (Q1910521) (← links)
- Applying Lehman's theorems to packing problems (Q1919808) (← links)
- On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
- Facets from gadgets (Q2220662) (← links)
- A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077) (← links)
- On the rational polytopes with Chvátal rank 1 (Q2288183) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- When the Gomory-chvátal closure coincides with the integer hull (Q2417111) (← links)
- A note on the 2-circulant inequalities for the MAX-cut problem (Q2417185) (← links)
- Optimization with binet matrices (Q2467475) (← links)
- On cycles and the stable multi-set polytope (Q2581319) (← links)
- Recognizing binet matrices (Q2638382) (← links)
- On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure (Q2670463) (← links)
- The Chvátal closure of generalized stable sets in bidirected graphs (Q2840520) (← links)
- Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point (Q3186518) (← links)
- Sensitivity theorems in integer linear programming (Q3793940) (← links)
- Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
- A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5925168) (← links)
- An extended formulation for the 1‐wheel inequalities of the stable set polytope (Q6068534) (← links)
- Polyhedral results and stronger Lagrangean bounds for stable spanning trees (Q6110626) (← links)
