A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints (Q1742190)
From MaRDI portal
scientific article
| 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 |
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
