Matrices with the Edmonds-Johnson property
From MaRDI portal
Publication:1100483
DOI10.1007/BF02579262zbMath0641.05039MaRDI QIDQ1100483
A. M. H. Gerards, Alexander Schrijver
Publication date: 1986
Published in: Combinatorica (Search for Journal in Brave)
Related Items
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach, On the feedback vertex set polytope of a series-parallel graph, Recognizing binet matrices, Note on a conjecture of Toft, Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point, On the stable set polytope of a series-parallel graph, An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem, Fractional and integral colourings, Stability critical graphs and ranks facets of the stable set polytope, Applying Lehman's theorems to packing problems, On cutting-plane proofs in combinatorial optimization, On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure, When the Gomory-chvátal closure coincides with the integer hull, A note on the 2-circulant inequalities for the MAX-cut problem, An extended formulation for the 1‐wheel inequalities of the stable set polytope, Polyhedral results and stronger Lagrangean bounds for stable spanning trees, Rational and integral \(k\)-regular matrices., Sensitivity theorems in integer linear programming, Deriving compact extended formulations via LP-based separation techniques, Facets from gadgets, A branch and cut solver for the maximum stable set problem, Optimization with binet matrices, On matrices with the Edmonds-Johnson property arising from bidirected graphs, Deriving compact extended formulations via LP-based separation techniques, A tutorial on branch and cut algorithms for the maximum stable set problem, A branch and cut algorithm for minimum spanning trees under conflict constraints, A note on kernels and Sperner's Lemma, On shortest \(T\)-joins and packing \(T\)-cuts, On matrices with the Edmonds-Johnson property, A min-max relation for stable sets in graphs with no odd-\(K_ 4\), On the rational polytopes with Chvátal rank 1, Fractional matroid matchings, Polyhedral techniques in combinatorial optimization I: Theory, \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts, The Chvátal closure of generalized stable sets in bidirected graphs, Stable sets, corner polyhedra and the Chvàtal closure, Odd-\(K_{4}\)'s in stability critical graphs, Coloring graphs with no \(\text{odd-}K_4\), On cycles and the stable multi-set polytope, The maximum clique problem, On a generalization of the Chvátal-Gomory closure
Cites Work
- Unnamed Item
- A class of h-perfect 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
- On certain polytopes associated with graphs
- Edmonds polytopes and a hierarchy of combinatorial problems
- Transformations which Preserve Perfectness and H-Perfectness of Graphs
- Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
- Matching, Euler tours and the Chinese postman
- Maximum matching and a polyhedron with 0,1-vertices
