The minimum cost perfect matching problem with conflict pair constraints (Q340285)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6652545
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum cost perfect matching problem with conflict pair constraints |
scientific article; zbMATH DE number 6652545 |
Statements
The minimum cost perfect matching problem with conflict pair constraints (English)
0 references
14 November 2016
0 references
matching problem
0 references
conflict pairs
0 references
conflict graph
0 references
assignment problem
0 references
0.90184485912323
0 references
0.7925970554351807
0 references
0.7595319747924805
0 references
0.7494421005249023
0 references
0.7494421005249023
0 references
