Integrated Methods for Optimization

  • John N. Hooker

Part of the International Series in Operations Research & Management Science book series (ISOR, volume 100)

Table of contents

  1. Front Matter
    Pages i-xiv
  2. Pages 1-14
  3. Pages 15-104
  4. Pages 105-248
  5. Pages 249-413
  6. Back Matter
    Pages 449-486

About this book

Introduction

Integrated Methods for Optimization integrates the key concepts of Mathematical Programming and Constraint Programming into a unified framework that allows them to be generalized and combined. The unification of MP and CP creates optimization methods that have much greater modeling power, increased computational speed, and a sizeable reduction computational coding. Hence the benefits of this integration are substantial, providing the Applied Sciences with a powerful, high-level modeling solution for optimization problems. As reviewers of the book have noted, this integration along with constraint programming being incorporated into a number of programming languages, brings the field a step closer to being able to simply state a problem and having the computer solve it.

John Hooker is a leading researcher in both the Optimization and Constraint Programming research communities. He has been an instrumental principal for this integration, and over the years, he has given numerous presentations and tutorials on the integration of these two areas. It is felt by many in the field that the future Optimization courses will increasingly be taught from this integrated framework.

Keywords

Optimization Methods computer linear optimization logic mathematical programming modeling optimization programming programming language scheduling

Authors and affiliations

  • John N. Hooker
    • 1
  1. 1.Carnegie Mellon UniversityPittsburghUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-0-387-38274-6
  • Copyright Information Springer Science+Business Media, LLC 2007
  • Publisher Name Springer, Boston, MA
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-0-387-38272-2
  • Online ISBN 978-0-387-38274-6
  • Series Print ISSN 0884-8289
  • About this book