Integer and combinatorial optimization
Integer and combinatorial optimization
Analyzing scalability of parallel algorithms and architectures
Journal of Parallel and Distributed Computing - Special issue on scalability of parallel algorithms and architectures
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
OpenMP: An Industry-Standard API for Shared-Memory Programming
IEEE Computational Science & Engineering
Building a parallel branch and bound library
Solving Combinatorial Optimization Problems in Parallel - Methods and Techniques
Branch, Cut, and Price: Sequential and Parallel
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
A generalized utility for parallel branch and bound algorithms
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Parallel Best-First Branch-and-Bound in Discrete Optimization
Parallel Best-First Branch-and-Bound in Discrete Optimization
Topics in parallel integer optimization
Topics in parallel integer optimization
A grid-aware MIP solver: Implementation and case studies
Future Generation Computer Systems
Parallel and distributed local search in COMET
Computers and Operations Research
Computational Experience with a Software Framework for Parallel Integer Programming
INFORMS Journal on Computing
A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
Computers and Operations Research
Computational experience with branch, cut and price algorithms in grid environments
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
A grid-aware branch, cut and price implementation
PVM/MPI'05 Proceedings of the 12th European PVM/MPI users' group conference on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Hi-index | 0.00 |
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.