A new algorithm for general matching problems using network flow subproblems (Q3829354)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for general matching problems using network flow subproblems |
scientific article |
Statements
A new algorithm for general matching problems using network flow subproblems (English)
0 references
1989
0 references
minimum cost perfect matching
0 references
active constraint set strategy
0 references
matching polytope
0 references
blossom inequalities
0 references
minimum cost network flow
0 references
