On the cycle polytope of a binary matroid
From MaRDI portal
Publication:1078187
DOI10.1016/0095-8956(86)90063-8zbMath0596.05018OpenAlexW2034664894MaRDI QIDQ1078187
Francisco Barahona, Martin Grötschel
Publication date: 1986
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(86)90063-8
Related Items
Decomposition and optimization over cycles in binary matroids, Application of cut polyhedra. I, Facets of the \(k\)-partition polytope, Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem, Multi-depot rural postman problems, A branch-and-cut algorithm for the maximum benefit Chinese postman problem, Upgrading edges in the graphical TSP, The generalized arc routing problem, A Branch-and-Cut method for the Capacitated Location-Routing Problem, The multi‐purpose K‐drones general routing problem, Chordal matroids arising from generalized parallel connections, Cycle algebras and polytopes of matroids, A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs, T-uniqueness of some families of \(k\)-chordal matroids, A polyhedral approach to an integer multicommodity flow problem, The periodic rural postman problem with irregular services on mixed graphs, On a composition of independence systems by circuit identification, Cuboids, a class of clutters, Binary Supersolvable Matroids and Modular Constructions, On the general routing polytope, The undirected capacitated general routing problem with profits, Facets for the cut cone. I, The inequicut cone, The even and odd cut polytopes, The Steiner traveling salesman problem and its extensions, Minimum cut bases in undirected networks, How is a chordal graph like a supersolvable binary matroid?, Privatized rural postman problems, Min-Max K -vehicles windy rural postman problem, Recent results on Arc Routing Problems: An annotated bibliography, A metaheuristic for the min-max windy rural postman problem with K vehicles, Solving the length constrained \(K\)-drones rural postman problem, Pseudocodeword-free criterion for codes with cycle-free Tanner graph, Idealness and 2-resistant sets, Master polytopes for cycles of binary matroids, On Vertices and Facets of Combinatorial 2-Level Polytopes, Analysis of effective sets of routes for the split-delivery periodic inventory routing problem, Solving the prize-collecting rural postman problem, Idealness of \(k\)-wise intersecting families
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The max-cut problem on graphs not contractible to \(K_ 5\)
- Matroids and multicommodity flows
- Some polyhedra related to combinatorial problems
- Binary group and Chinese postman polyhedra
- Adjacency on the Postman Polyhedron
- Matching, Euler tours and the Chinese postman
- Maximum matching and a polyhedron with 0,1-vertices
