A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints (Q1742190)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints |
scientific article; zbMATH DE number 6858338
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints |
scientific article; zbMATH DE number 6858338 |
Statements
A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints (English)
0 references
11 April 2018
0 references
branch and bound
0 references
bipartite perfect matching problem
0 references
conflict graph
0 references
assignment problem
0 references
0.9224631
0 references
0.87818223
0 references
0.8719576
0 references
0.87001395
0 references
0.86921144
0 references
0.8656156
0 references
0.8644731
0 references
0.86399806
0 references
