Handbook on Modelling for Discrete Optimization

  • Gautam Appa
  • Leonidas Pitsoulis
  • H. Paul Williams
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 88)

Table of contents

  1. Front Matter
    Pages i-xxii
  2. Methods

    1. Front Matter
      Pages 1-1
    2. Panos M Pardalos, Oleg A Prokopyev, Stanislav Busygin
      Pages 39-60
    3. John N Hooker
      Pages 61-102
    4. Gautam Appa, Dimitris Magos, Ioannis Mourtos, Leonidas Pitsoulis
      Pages 103-127
    5. Douglas R. Shier
      Pages 129-149
    6. Jean-Francois Cordeau, Gilbert Laporte
      Pages 151-191
  3. Applications

    1. Front Matter
      Pages 193-193
    2. Katerina Papadaki, Vasilis Friderikos
      Pages 195-225
    3. Michael C. Ferris, Robert R. Meyer, Warren D’Souza
      Pages 317-340
    4. Aubrey B Poore, Sabino M Gadaleta, Benjamin J Slocumb
      Pages 341-371
    5. Giuseppe Lancia
      Pages 373-425
  4. Back Matter
    Pages 427-431

About this book

Introduction

The primary objective underlying the Handbook on Modelling for Discrete Optimization is to demonstrate and detail the pervasive nature of Discrete Optimization. While its applications cut across an incredibly wide range of activities, many of the applications are only known to specialists. It is the aim of this handbook to correct this.

It has long been recognized that "modelling" is a critically important mathematical activity in designing algorithms for solving these discrete optimization problems. Nevertheless solving the resultant models is also often far from straightforward. In recent years it has become possible to solve many large-scale discrete optimization problems. However, some problems remain a challenge, even though advances in mathematical methods, hardware, and software technology have pushed the frontiers forward. This handbook couples the difficult, critical-thinking aspects of mathematical modeling with the hot area of discrete optimization. It will be done in an academic handbook treatment outlining the state-of-the-art for researchers across the domains of the Computer Science, Math Programming, Applied Mathematics, Engineering, and Operations Research. Included in the handbook's treatment are results from Graph Theory, Logic, Computer Science, and Combinatorics.

The chapters of this book are divided into two parts: (1) one dealing with general methods in the modelling of discrete optimization problems and (2) the other with specific applications. The first chapter of this volume, written by H. Paul Williams, can be regarded as a basic introduction of how to model discrete optimization problems as mixed integer problems, and outlines the main methods of solving them. In the second part of the book various real life applications are presented, most of them formulated as mixed integer linear or nonlinear programming problems. These applications include network problems, constant logic problems, many engineering problems, computer design, finance problems, medical diagnosis and medical treatment problems, applications of the Genome project, an array of transportation scheduling problems, and other applications.

Further information including a detailed Table of Contents and Preface can be found and examined on the Handbook's web pages at http://www.springer.com/0-387-32941-2.

Keywords

Hardware algorithm algorithms combinatorics computer computer science linear optimization model modeling modelling nonlinear optimization operations research optimization programming scheduling

Editors and affiliations

  • Gautam Appa
    • 1
  • Leonidas Pitsoulis
    • 2
  • H. Paul Williams
    • 1
  1. 1.Operational Research DepartmentLondon School of EconomicsUK
  2. 2.Department of Mathematical and Physical SciencesAristotle University of ThessalonikiGreece

Bibliographic information

  • DOI https://doi.org/10.1007/0-387-32942-0
  • Copyright Information Springer Science+Business Media, Inc. 2006
  • Publisher Name Springer, Boston, MA
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-0-387-32941-3
  • Online ISBN 978-0-387-32942-0
  • Series Print ISSN 0884-8289
  • About this book