Solving large-scale matching problems efficiently: A new primal matching approach (Q3786301): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230160102 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966424895 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:06, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving large-scale matching problems efficiently: A new primal matching approach |
scientific article |
Statements
Solving large-scale matching problems efficiently: A new primal matching approach (English)
0 references
1986
0 references
minimum-cost-perfect-matching problem
0 references
weighted matching
0 references
large dense graphs
0 references
two-phase approach
0 references
