Integer and combinatorial optimization
Integer and combinatorial optimization
Polyhedral study of the capacitated vehicle routing problem
Mathematical Programming: Series A and B
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
Mixed 0-1 programming by lift-and-project in a branch-and-cut framework
Management Science
Software—Practice & Experience - Special issue on discrete algorithm engineering
Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications
ICCS '02 Proceedings of the International Conference on Computational Science-Part I
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]
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
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
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
A decomposition approach to multi-vehicle cooperative control
Robotics and Autonomous Systems
A comparison of problem decomposition techniques for the FAP
Journal of Heuristics
A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem
Expert Systems with Applications: An International Journal
Multi-start heuristics for the two-echelon vehicle routing problem
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Minimal load constrained vehicle routing problems
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
| Hi-index | 0.00 |
Combinatorial optimization problems arise commonly in logistics applications. The most successful approaches to date for solving such problems involve modeling them as integer programs and then applying some variant of the branch and bound algorithm. Although branch and bound is conceptually easy to parallelize, achieving scalability can be a challenge. In more sophisticated variants, such as branch and cut, large amounts of data must be shared among the processors, resulting in increased parallel overhead. In this paper, we review the branch and cut algorithm for solving combinatorial optimization problems and describe the implementation of SYMPHONY, a library for implementing these algorithms in parallel. We then describe a solver for the vehicle routing problem that was implemented using SYMPHONY and analyze its parallel performance on a Beowulf cluster.