Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/10388
Title: | Networks in Action: Computer Exercises in Network Optimization |
Authors: | Sierksma, G. Ghosh, Diptesh |
Keywords: | Networking;Network Optimization;Network Theory;Not-Too-Large Network Optimization |
Issue Date: | 12-Jan-2011 |
Publisher: | Springer |
Citation: | Sierksma, G., & Ghosh, D. (2010). Networks in Action: Computer Exercises in Network Optimization. New York: Springer. |
Abstract: | Most books covering network optimization explain the theory but offer only exercises that support the understanding of that theory, and case studies that are offered are not suitable for classroom analysis, either because data sets are missing or they’re just too large to handle in the classroom. Networks in Action: Text and Computer Exercises in Network Optimization contains a wide range of not-too-large network optimization problems that need to be analyzed and solved by using the computer. Using case studies based on a single fictitious company throughout, the book presents exercises in each chapter that are at once small enough to solve in the classroom, while too large to be solved by eye. After providing an overview of the modeling and implementing process, a look at network theory, and comprehensive listing of references with comments, the book looks shortest paths, minimum spanning trees, network flows, matchings, facility location, and cyclic routing on networks. Each chapter contains exercises that have been rigorously classroom-tested. The result is a perfect text for a one-semester course on network optimization, whether at the advanced undergraduate or the graduate level within an operations research program, econometrics, or as part of an MBA program. |
Description: | New York: Springer |
URI: | http://hdl.handle.net/11718/10388 |
Appears in Collections: | Books |
Files in This Item:
There are no files associated with this item.
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.