Network and Discrete Location: Models, Algorithms, and Applications

Emphasizing the algorithms and modeling issues involved with network location problems, it introduces a number of the classical facility location models on which other more complex and realistic models are based. Describes key methodologies used to solve facility location problems including linear programming, selected graph theoretic algorithms, Lagrangian relaxation, branch and bound, heuristic algorithms and Bender's decomposition. These methods teach readers how the basic approach works, when it is useful, what information it provides and how good the results are likely to be when the approach is applied. The accompanying disk contains coded algorithms for problem solving.

About the Author

MARK S. DASKIN, PhD, is Clyde W. Johnson Collegiate Professor of Industrial and Operations Engineering as well as Department Chair at the University of Michigan. Dr. Daskin is the former editor-in-chief of both Transportation Science and IIE Transactions and continues to serve on the editorial boards of both journals. He is also on the editorial board of the IIE Transactions on Healthcare Systems Engineering and is the author of the award-winning book Service Science , also published by Wiley.