Daskin M.S. Network and Discrete Location. Models, Algorithms, and Applications

John Wiley, 2013, -535 p.
This text attempts to realize a number of goals. First, the book attempts to introduce the reader to a number of classical facility location models on which other more complicated and realistic models are based. Second, the book tries to assist the reader in developing his or her own modeling skills. Toward that end, many of the exercises at the end of the chapters ask the reader to formulate problems or to extend traditional formulations. Third, the text introduces the reader to a number of key methodologies that are used in solving facility location problems and the related problem of allocating demands to facilities. These methodologies include: linear programming, selected graph-theoretic algorithms, heuristic algorithms, Lagrangian relaxation, branch and bound, dual ascent algorithms, and Bender’s decomposition. When it comes to methodologies, the goal is to teach the reader how the basic approach works, when it is useful, what information is provided by the approach, and how good the results are likely to be when the approach is employed. It is my hope that the modeling and methodological skills that the reader develops in the course of using this text will be transferable to problem contexts above and beyond those that arise in locating facilities. Fourth, the text attempts to introduce students to selected applications both through the text itself and through the exercises at the end of the chapters. Finally, the online appendix for the book provides students with software capable of solving most of the basic location problems on moderate-sized networks.
The background required for most of this book is quite minimal. Students should be familiar with elementary notions of linear algebra including the use of summation signs, subscripted variables, and other basic notation. In addition, some exposure to linear programming is desirable though not absolutely necessary as Chapter 2 reviews the essential concepts of linear programming that are used later in the text. The software included in the online appendix to the text runs on Windows machines only and users should be familiar with the basics of such machines.
Introduction to Location Theory and Models.
Review of Linear Programming.
An Overview of Complexity Analysis.
Covering Problems.
Center Problems.
Median Problems.
Fixed Charge Facility Location Problems.
Extensions of Location Models.
Location Modeling in Perspective.