Pages that link to "Item:Q3686027"
From MaRDI portal
The following pages link to Performance of parallel branch-and-bound algorithms (Q3686027):
Displaying 8 items.
- An efficient data structure for branch-and-bound algorithm (Q558042) (← links)
- Large-scale 0-1 linear programming on distributed workstations (Q750295) (← links)
- A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF (Q779440) (← links)
- Branch-and-bound and parallel computation: A historical note (Q1099088) (← links)
- A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions (Q1107978) (← links)
- Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem (Q1118534) (← links)
- Parallel processing for difficult combinatorial optimization problems (Q1268289) (← links)
- Performances of parallel branch and bound algorithms with best-first search (Q1917301) (← links)
