Optimizing over a slice of the bipartite matching polytope (Q1111947): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Exact arborescences, matchings and cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4729832 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On minimal elementary bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of restricted spanning tree problems / rank | |||
Normal rank | |||
Revision as of 10:00, 19 June 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
