Pages that link to "Item:Q1808184"
From MaRDI portal
The following pages link to On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search (Q1808184):
Displaying 14 items.
- Evaluation of a simple, scalable, parallel best-first search strategy (Q360118) (← links)
- Global optimization of robust truss topology via mixed integer semidefinite programming (Q374690) (← links)
- Search methods for tile sets in patterned DNA self-assembly (Q395021) (← links)
- Tensor based approach to the numerical treatment of the parameter estimation problems in mathematical immunology (Q682032) (← links)
- PEBBL: an object-oriented framework for scalable parallel branch and bound (Q903924) (← links)
- Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm (Q1725624) (← links)
- An efficient solution method to design the cost-minimizing platform portfolio (Q1751801) (← links)
- Performances of parallel branch and bound algorithms with best-first search (Q1917301) (← links)
- Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search (Q2026990) (← links)
- Parameter tuning for a cooperative parallel implementation of process-network synthesis algorithms (Q2418170) (← links)
- Revisiting branch and bound search strategies for machine scheduling problems (Q2464435) (← links)
- Scheduling problem in seru production system considering DeJong's learning effect and job splitting (Q2673820) (← links)
- Cyclic best first search: Using contours to guide branch‐and‐bound algorithms (Q4632957) (← links)
- Grouped variable selection with discrete optimization: computational and statistical perspectives (Q6046300) (← links)
