A Separation Algorithm for b-Matching Degree-Sequence Polyhedra

DOI10.1287/moor.28.1.92.14263zbMath1082.90146OpenAlexW2013168998MaRDI QIDQ5704115

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

combinatorial optimizationdegree sequence\(b\)-matchingpolyhedron combinatorics

Mathematics Subject Classification ID

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

Related Items (1)

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