The primary reason for producing this book is to demonstrate and commu nicate the pervasive nature of Discrete Optimisation. It has applications across a very wide range of activities. Many of the applications are only known to specialists. Our aim is to rectify this. It has long been recognized that ''modelling" is as important, if not more important, a mathematical activity as designing algorithms for solving these discrete optimisation problems. Nevertheless solving the resultant models is also often far from straightforward. Although in recent years it has become viable to solve many large scale discrete optimisation problems some problems remain a challenge, even as advances in mathematical methods, hardware and software technology are constantly pushing the frontiers forward. The subject brings together diverse areas of academic activity as well as di verse areas of applications. To date the driving force has been Operational Re search and Integer Programming as the major extention of the well-developed subject of Linear Programming. However, the subject also brings results in Computer Science, Graph Theory, Logic and Combinatorics, all of which are reflected in this book. We have divided the chapters in this book into two parts, one dealing with general methods in the modelling of discrete optimisation problems and one with specific applications. The first chapter of this volume, written by Paul Williams, can be regarded as a basic introduction of how to model discrete optimisation problems as Mixed Integer Programmes, and outlines the main methods of solving them.
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.
