Binary group and Chinese postman polyhedra
From MaRDI portal
Publication:3717740
DOI10.1007/BF01582160zbMath0589.52004OpenAlexW2088810984MaRDI QIDQ3717740
Gilles Gastou, Ellis L. Johnson
Publication date: 1986
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582160
Extremal problems in graph theory (05C35) Integer programming (90C10) Inequalities and extremum problems involving convexity in convex geometry (52A40) Combinatorial aspects of matroids and geometric lattices (05B35) Polytopes and polyhedra (52Bxx)
Related Items
On the cycle polytope of a binary matroid ⋮ Polyhedra of regular p-nary group problems ⋮ Dual row modules and polyhedra of blocking group problems ⋮ Binary group facets with complete support and non-binary coefficients ⋮ Compositions in the bipartite subgraph polytope ⋮ My experiences as a student and researcher in OR during the 1960's and 70's ⋮ On Four Problems in Graph Theory ⋮ Four problems on graphs with excluded minors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterizations of adjacency on the branching polyhedron
- Decomposition of regular matroids
- Weakly bipartite graphs and the max-cut problem
- The matroids with the max-flow min-cut property
- Invariant imbedding, particle interaction, and conservation relations
- Some polyhedra related to combinatorial problems
- An Algorithm for Determining Whether a Given Binary Matroid is Graphic
- On the Generality of the Subadditive Characterization of Facets
- Mappings and Facets for Nonabelian Group Problems
- On the width—length inequality
- Converting Linear Programs to Network Problems
- On Tutte's Characterization of Graphic Matroids
- Some Results on Polyhedra of Semigroup Problems
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Non-Separable and Planar Graphs
- Matching, Euler tours and the Chinese postman
- On the facial structure of set packing polyhedra
- Paths, Trees, and Flowers
- A Solution of the Shannon Switching Game
- Maximum matching and a polyhedron with 0,1-vertices
- Lectures on matroids
