COPS

Introduction

COPS provides a C++ class library for implementing scalable algorithms based on parallel tree search. The library implements the search handling methods required for implementing large-scale, data-intensive parallel search algorithms, such as those used for solving discrete optimization problems. The primary focus of this research is to improve the scalability of these algorithms, given that very large amounts of data are required to describe each search tree node.

---

Cops Availability

COPS is available open source through COIN-OR.

---

Related publications/presentations

T.K.R., Parallel Branch and Cut, in Parallel Combinatorial Optimization, E. Talbi, ed. (2006) (Working paper version: PS PDF)

Y. Xu, T.K.R., L. nyi, and M.J. Saltzman, ALPS: A Framework for Implementing Parallel Search Algorithms, The Proceedings of the Ninth INFORMS Computing Society Conference (2005), 319 (Working paper version: PS PDF).

Ted Ralphs, L. Ladanyi, and M.J. Saltzman, A Library Hierarchy for Implementing Scalable Parallel Search Algorithms, The Journal of Supercomputing 28 (2004), 215. (Working paper version: PS PDF).

Ted Ralphs, L. Ladanyi, and M.J. Saltzman, Parallel Branch, Cut, and Price for Large-scale Discrete Optimization, Mathematical Programming 98 (2003), 253 (Working paper version: PS PDF).