Implementation of parallel branch-and-bound algorithms – experiences with the graph partitioning problem Jens ClausenJesper Larsson Träff Section V Heuristics And Paraller Algorithms Pages: 329 - 349
Least-cost network topology design for a new service Fred GloverMicheal LeeJennifer Ryan Section V Heuristics And Paraller Algorithms Pages: 351 - 362
Computing shortest paths in networks derived from recurrence relations E. L. Lawler Section V Heuristics And Paraller Algorithms Pages: 363 - 377
Branch-and-bound as a higher-order function G. P. McKeownV. J. Rayward-SmithH. J. Turpin Section V Heuristics And Paraller Algorithms Pages: 379 - 402