On the cycle polytope of a binary matroid
From MaRDI portal
Recommendations
- Master polytopes for cycles of binary matroids
- Decomposition and optimization over cycles in binary matroids
- Adjacency on combinatorial polyhedra
- On the cardinality constrained matroid polytope
- Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
Cites work
- scientific article; zbMATH DE number 3862930 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- Adjacency on the Postman Polyhedron
- Binary group and Chinese postman polyhedra
- Matching, Euler tours and the Chinese postman
- Matroids and multicommodity flows
- Maximum matching and a polyhedron with 0,1-vertices
- Some polyhedra related to combinatorial problems
- The max-cut problem on graphs not contractible to \(K_ 5\)
Cited in
(46)- How is a chordal graph like a supersolvable binary matroid?
- Pseudocodeword-free criterion for codes with cycle-free Tanner graph
- On the circuit-spectrum of binary matroids
- A polyhedral approach to an integer multicommodity flow problem
- On the general routing polytope
- The periodic rural postman problem with irregular services on mixed graphs
- A metaheuristic for the min-max windy rural postman problem with K vehicles
- Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem
- Chordal matroids arising from generalized parallel connections
- Facets of the \(k\)-partition polytope
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem
- Idealness of \(k\)-wise intersecting families
- The undirected capacitated general routing problem with profits
- The generalized arc routing problem
- Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem
- Cuboids, a class of clutters
- Recognizing Even-Cycle and Even-Cut Matroids
- Solving the length constrained \(K\)-drones rural postman problem
- Cardinality minimization, constraints, and regularization: a survey
- Upgrading edges in the graphical TSP
- Master polytopes for cycles of binary matroids
- Analysis of effective sets of routes for the split-delivery periodic inventory routing problem
- scientific article; zbMATH DE number 49899 (Why is no real title available?)
- The inequicut cone
- The multi‐purpose K‐drones general routing problem
- The even and odd cut polytopes
- A Semiring on Convex Polygons and Zero-Sum Cycle Problems
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- Cycle bases for lattices of binary matroids with no Fano dual minor and their one-element extensions
- Idealness and 2-resistant sets
- Multi-depot rural postman problems
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
- Application of cut polyhedra. I
- Privatized rural postman problems
- Decomposition and optimization over cycles in binary matroids
- Cycle algebras and polytopes of matroids
- T-uniqueness of some families of \(k\)-chordal matroids
- Recent results on arc routing problems: an annotated bibliography
- Facets for the cut cone. I
- Min-Max \(K\)-vehicles windy rural postman problem
- Binary Supersolvable Matroids and Modular Constructions
- Minimum cut bases in undirected networks
- On a composition of independence systems by circuit identification
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
- The Steiner traveling salesman problem and its extensions
- Solving the prize-collecting rural postman problem
This page was built for publication: On the cycle polytope of a binary matroid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1078187)
