Matrices with the Edmonds-Johnson property
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- A class of h-perfect graphs
- Edmonds polytopes and a hierarchy of combinatorial problems
- Matching, Euler tours and the Chinese postman
- Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
- Maximum matching and a polyhedron with 0,1-vertices
- On certain polytopes associated with graphs
- Polytope des independants d'un graphe série-parallèle
- The ellipsoid method and its consequences in combinatorial optimization
- The matroids with the max-flow min-cut property
- Transformations which Preserve Perfectness and H-Perfectness of Graphs
Cited in
(42)- On a generalization of the Chvátal-Gomory closure
- Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
- Rational and integral \(k\)-regular matrices.
- A note on kernels and Sperner's Lemma
- The maximum clique problem
- Optimization with binet matrices
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem
- Facets from gadgets
- On the stable set polytope of a series-parallel graph
- On the feedback vertex set polytope of a series-parallel graph
- On matrices with the Edmonds-Johnson property arising from bidirected graphs
- On cutting-plane proofs in combinatorial optimization
- A tutorial on branch and cut algorithms for the maximum stable set problem
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
- Note on a conjecture of Toft
- Fractional matroid matchings
- A branch and cut solver for the maximum stable set problem
- The Chvátal closure of generalized stable sets in bidirected graphs
- Polyhedral techniques in combinatorial optimization I: Theory
- When the Gomory-chvátal closure coincides with the integer hull
- On cycles and the stable multi-set polytope
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- Stable sets, corner polyhedra and the Chvàtal closure
- On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure
- Deriving compact extended formulations via LP-based separation techniques
- scientific article; zbMATH DE number 3902397 (Why is no real title available?)
- Stability critical graphs and ranks facets of the stable set polytope
- Applying Lehman's theorems to packing problems
- Deciding emptiness of the Gomory-Chvátal closure is NP-complete, even for a rational polyhedron containing no integer point
- Odd-\(K_{4}\)'s in stability critical graphs
- On the rational polytopes with Chvátal rank 1
- On matrices with the Edmonds-Johnson property
- Sensitivity theorems in integer linear programming
- Polyhedral results and stronger Lagrangean bounds for stable spanning trees
- An extended formulation for the 1‐wheel inequalities of the stable set polytope
- A note on the 2-circulant inequalities for the MAX-cut problem
- Fractional and integral colourings
- A branch and cut algorithm for minimum spanning trees under conflict constraints
- Recognizing binet matrices
- On shortest T-joins and packing T-cuts
- Deriving compact extended formulations via LP-based separation techniques
- Coloring graphs with no \(\text{odd-}K_4\)
This page was built for publication: Matrices with the Edmonds-Johnson property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1100483)
