Optimizing over a slice of the bipartite matching polytope (Q1111947)
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: Optimizing over a slice of the bipartite matching polytope |
scientific article; zbMATH DE number 4076989
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimizing over a slice of the bipartite matching polytope |
scientific article; zbMATH DE number 4076989 |
Statements
Optimizing over a slice of the bipartite matching polytope (English)
0 references
1989
0 references
We discuss a special case of the Exact Perfect Matching Problem, which is polynomially solvable. A good algorithm is given.
0 references
polynomial solution
0 references
Exact Perfect Matching
0 references
