Pages that link to "Item:Q1742190"
From MaRDI portal
The following pages link to A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints (Q1742190):
Displaying 4 items.
- Assignment problem with conflicts (Q2273673) (← links)
- Minimum cost flow problem with conflicts (Q6065835) (← links)
- Maximum weight perfect matching problem with additional disjunctive conflict constraints (Q6179693) (← links)
- Solving the set covering problem with conflicts on sets: a new parallel GRASP (Q6568410) (← links)
