Optimizing over a slice of the bipartite matching polytope (Q1111947): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(88)90143-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969175178 / rank | |||
Normal rank | |||
Latest revision as of 10:23, 30 July 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
