This paper describes the design of the Abstract Library for Parallel Search (ALPS), a framework for implementing scalable, parallel algorithms based on tree search. ALPS is specifically designed to support data-intensive algorithms, in which large amounts of data are required to describe each node in the search tree. Implementing such algorithms in a scalable manner is challenging both because of data storage requirements and communication overhead. ALPS incorporates a number of new ideas to address this challenge. The paper also describes the design of two other libraries forming a hierarchy built on top of ALPS. The first is the Branch, Constrain, and Price Software (BiCePS) library, a framework that supports the implementation of parallel branch and bound algorithms in which the bounds are obtained by solving some sort of relaxation, usually Lagrangian. In this layer, the notion of global data objects associated with the variables and constraints is introduced. These global objects provide a connection between the various subproblems in the search tree, but they pose further difficulties for designing scalable algorithms. The other library is the BiCePS linear integer solver (BLIS), a concretization of BiCePS, in which linear programming is used to obtain bounds in each search tree node.

References in zbMATH (referenced in 17 articles , 1 standard article )

Showing results 1 to 17 of 17.
Sorted by year (citations)

  1. Kim, Kibaek; Dandurand, Brian: Scalable branching on dual decomposition of stochastic mixed-integer programming problems (2022)
  2. Tahernejad, Sahar; Ralphs, Ted K.; DeNegre, Scott T.: A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (2020)
  3. Munguía, Lluís-Miquel; Oxberry, Geoffrey; Rajan, Deepak; Shinano, Yuji: Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs (2019)
  4. Gurski, Frank; Rethmann, Jochen: Distributed solving of mixed-integer programs with GLPK and Thrift (2018)
  5. Shinano, Yuji; Heinz, Stefan; Vigerske, Stefan; Winkler, Michael: FiberSCIP -- a shared memory parallelization of SCIP (2018)
  6. Hehn, Andreas; van Well, Natalija; Troyer, Matthias: High-temperature series expansion for spin-1/2 Heisenberg models (2017)
  7. Herrera, Juan F. R.; Salmerón, José M. G.; Hendrix, Eligius M. T.; Asenjo, Rafael; Casado, Leocadio G.: On parallel branch and bound frameworks for global optimization (2017)
  8. Eckstein, Jonathan; Hart, William E.; Phillips, Cynthia A.: PEBBL: an object-oriented framework for scalable parallel branch and bound (2015)
  9. Mason, Luke R.; Mak-Hau, Vicky H.; Ernst, Andreas T.: A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning (2015)
  10. Subramanian, A.; Drummond, L. M. A.; Bentes, C.; Ochi, L. S.; Farias, R.: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery (2010)
  11. Linderoth, Jeff; Margot, François; Thain, Greg: Improving bounds on the football pool problem by integer programming and high-throughput computing (2009)
  12. Michel, Laurent; See, Andrew; van Hentenryck, Pascal: Parallel and distributed local search in COMET (2009)
  13. Vo, Khoa T.; Reinelt, Gerhard: Parallel computation for the bandwidth minimization problem (2009)
  14. Xu, Yan; Ralphs, Ted K.; Ladányi, László; Saltzman, Matthew J.: Computational experience with a software framework for parallel integer programming (2009)
  15. Crainic, Teodor Gabriel: Parallel solution methods for vehicle routing problems (2008)
  16. Linderoth, Jeffrey T.; Ralphs, Ted K.: Noncommercial software for mixed-integer linear programming (2006)
  17. Ralphs, T. K.; Ládanyi, L.; Saltzman, M. J.: A library hierarchy for implementing scalable parallel search algorithms (2004)