A Separation Algorithm for <i>b</i>-Matching Degree-Sequence Polyhedra (Q5704115)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Separation Algorithm for b-Matching Degree-Sequence Polyhedra |
scientific article; zbMATH DE number 2228280
Language | Label | Description | Also known as |
---|---|---|---|
English | A Separation Algorithm for <i>b</i>-Matching Degree-Sequence Polyhedra |
scientific article; zbMATH DE number 2228280 |
Statements
A Separation Algorithm for <i>b</i>-Matching Degree-Sequence Polyhedra (English)
0 references
11 November 2005
0 references
combinatorial optimization
0 references
\(b\)-matching
0 references
degree sequence
0 references
polyhedron combinatorics
0 references