Chapter 10. MW: A Software Framework for Combinatorial Optimization on Computational Grids

  1. El-Ghazali Talbi
  1. Wasu Glankwamdee and
  2. Jeff Linderoth

Published Online: 10 APR 2006

DOI: 10.1002/9780470053928.ch10

Parallel Combinatorial Optimization

Parallel Combinatorial Optimization

How to Cite

Glankwamdee, W. and Linderoth, J. (2006) MW: A Software Framework for Combinatorial Optimization on Computational Grids, in Parallel Combinatorial Optimization (ed E.-G. Talbi), John Wiley & Sons, Inc., Hoboken, NJ, USA. doi: 10.1002/9780470053928.ch10

Editor Information

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

Author Information

  1. Lehigh University, Dept. of Ind. & Systems Eng., 200 W. Packer Avenue, Bethlehem PA 18015, 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

SEARCH

Keywords:

  • combinatorial optimization on computational grids;
  • knapsack computation by Condor glide-in mechanism;
  • master–worker based parallel algorithms on computational grids

Summary

This chapter contains sections titled:

  • Introduction

  • Computational Grids

  • Branch and Bound

  • MW API

  • Additional MW Features

  • Case Study: The Knapsack Problem

  • Conclusions

  • Acknowledgments

  • References