On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph

DOI10.1016/0167-6377(87)90055-1zbMath0696.90079OpenAlexW2074520661MaRDI QIDQ911485

N. E. Zubov

Publication date: 1987

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(87)90055-1

zbMATH Keywords

convex hullbipartite graphsmaximum flowseparation problemindependence vectorperfectly matchable subgraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Polytopes and polyhedra (52Bxx)

Cites Work

• Hamiltonicity in (0-1)-polyhedra
• The ellipsoid method and its consequences in combinatorial optimization
• The perfectly matchable subgraph polytope of a bipartite graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph