Pages that link to "Item:Q2234743"
From MaRDI portal
The following pages link to Parallelization of a branch-and-bound algorithm for the maximum weight clique problem (Q2234743):
Displaying 5 items.
- A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem (Q336528) (← links)
- A parallel branch-and-bound method for cluster analysis (Q1808189) (← links)
- A parallel branch and bound algorithm for the maximum labelled clique problem (Q2355318) (← links)
- (Q4945422) (← links)
- Scatter search with stochastic beam search on the coalition formation problem (Q6149310) (← links)