A library hierarchy for implementing scalable parallel search algorithms
From MaRDI portal
Publication:1771087
DOI10.1023/B:SUPE.0000020179.55383.adzbMath1062.90039MaRDI QIDQ1771087
Ted K. Ralphs, Matthew J. Saltzman, Laszlo Ladanyi
Publication date: 7 April 2005
Published in: The Journal of Supercomputing (Search for Journal in Brave)
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Parallel algorithms in computer science (68W10)
Related Items
PEBBL: an object-oriented framework for scalable parallel branch and bound, FiberSCIP—A Shared Memory Parallelization of SCIP, A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation, Parallel Solution Methods for Vehicle Routing Problems, A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery, Parallel and distributed local search in COMET, ALPS, BLIS, BiCePS, CHiPPS
Uses Software
