Pages that link to "Item:Q1072940"
From MaRDI portal
The following pages link to An upper bound for the speedup of parallel best-bound branch-and-bound algorithms (Q1072940):
Displaying 4 items.
- Large-scale 0-1 linear programming on distributed workstations (Q750295) (← links)
- Performances of parallel branch and bound algorithms with best-first search (Q1917301) (← links)
- Anomalies in parallel branch-and-bound algorithms (Q3713596) (← links)
- Parallel best-first branch-and-bound in discrete optimization: a framework (Q6560208) (← links)