Chapter 3. Parallel Branch and Cut

  1. El-Ghazali Talbi
  1. T. K. Ralphs

Published Online: 10 APR 2006

DOI: 10.1002/9780470053928.ch3

Parallel Combinatorial Optimization

Parallel Combinatorial Optimization

How to Cite

Ralphs, T. K. (2006) Parallel Branch and Cut, in Parallel Combinatorial Optimization (ed E.-G. Talbi), John Wiley & Sons, Inc., Hoboken, NJ, USA. doi: 10.1002/9780470053928.ch3

Editor Information

  1. LIFL—University of Lille—INRIA—CNRS, Bat.M3 Cité Scientifique, 59655 Villeneuve d'Ascq, France

Author Information

  1. Department of Industrial and Systems Engineering, Lehigh University, 200 W. Packer Ave., Bethlehem, PA 18015-1583, USA

Publication History

  1. Published Online: 10 APR 2006
  2. Published Print: 13 OCT 2006

Book Series:

  1. Wiley Series on Parallel and Distributed Computing

Book Series Editors:

  1. Albert Y. Zomaya

ISBN Information

Print ISBN: 9780471721017

Online ISBN: 9780470053928



  • branch-and-cut algorithm and mixed-integer linear programs (MILPs);
  • parallelizing branch and cut;
  • algorithms - SYMPHONY and ALPS


This chapter contains sections titled:

  • Introduction

  • Background

  • Parallelizing Branch and Cut

  • Algorithms

  • Computation

  • Conclusions and Future Work

  • References