ALPS
swMATH ID:  36 
Software Authors:  Ralphs, T.K.; Ládanyi, L.; Saltzman, M.J. 
Description:  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 dataintensive 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. 
Homepage:  https://projects.coinor.org/CHiPPS 
Source Code:  https://github.com/coinor/CHiPPSALPS 
Related Software:  BiCePS; CHiPPS; BLIS; SYMPHONY; PICO; CPLEX; MIPLIB; PEBBL; ParaSCIP; SCIP; UG; COINOR; ABACUS; Concorde; DSP; GitHub; ParaLEX; MIPLIB2003; FiberSCIP; HTCondor MW 
Cited in:  17 Publications 
Standard Articles
1 Publication describing the Software, including 1 Publication in zbMATH  Year 

A library hierarchy for implementing scalable parallel search algorithms. Zbl 1062.90039 Ralphs, T. K.; Ládanyi, L.; Saltzman, M. J. 
2004

all
top 5
Cited by 45 Authors
all
top 5