Optimizing over a slice of the bipartite matching polytope (Q1111947): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:20, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimizing over a slice of the bipartite matching polytope |
scientific article |
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
