Pages that link to "Item:Q1247917"
From MaRDI portal
The following pages link to Branching from the largest upper bound. Folklore and facts (Q1247917):
Displaying 4 items.
- A parallel branch and bound algorithm for the quadratic assignment problem (Q1095791) (← links)
- Heuristics and their design: A survey (Q1152854) (← links)
- Performances of parallel branch and bound algorithms with best-first search (Q1917301) (← links)
- Parallel best-first branch-and-bound in discrete optimization: a framework (Q6560208) (← links)
