A Separation Algorithm for b-Matching Degree-Sequence Polyhedra

DOI10.1287/MOOR.28.1.92.14263MaRDI QIDQ5704115zbMATH OpenOpenAlexFDO

Authors Fan Zhang

Publication date 11 November 2005

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.28.1.92.14263

zbMATH Keywords

\(b\)-matchingcombinatorial optimizationdegree sequencepolyhedron combinatorics

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A separation algorithm for the matchable set polytope
• b-matching degree-sequence polyhedra
• A linear algorithm for determining the separation of convex polyhedra
• The vertex separator problem: a polyhedral investigation
• A new separation algorithm for the Boolean quadric and cut polytopes
• On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph
• The k-separator problem: polyhedra, complexity and approximation results
• On the problem polyhedral separability: a numerical solution
• scientific article; zbMATH DE number 742976
• A polynomial algorithm for b-matchings: An alternative approach

Cited in

(5)

• b-matching degree-sequence polyhedra
• A separation algorithm for the matchable set polytope
• Integer Programming and Combinatorial Optimization
• Parameterized algorithms for matching integer programs with additional rows and columns
• Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization

This page was built for publication: A Separation Algorithm for b-Matching Degree-Sequence Polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704115)