Papers from a March 2002 workshop held at the University of California-Davis address problems associated with protecting and attacking computer, transportation, and social networks. Optimization models that deal with the stochastic nature of these problems are an important part of the book. Some specific topics include interdicting smuggled nuclear material, a decomposition-based approximation for network inhibition, interdicting stochastic networks, stochastic batch sizing, and disjunctive decomposition with set convexification. Woodruff is affiliated with the University of California-Davis. Annotation (c) Book News, Inc., Portland, OR (booknews.com)
The Network Interdiction Problem has a wide variety of applications in areas such as transportation, but more recently and very prominently, it has applications in the communications area. Network Interdiction and Stochastic Integer Programming focuses on problems associated with protecting and attacking computer, transportation, and social networks. These research areas gain importance as the world becomes more dependent on interconnected systems. Optimization models that address the stochastic nature of the problems are an important part of the book and it contains discussion of recent efforts to provide methods for addressing stochastic mixed integer programs.
The book is organized with interdiction papers first and the stochastic programming papers in the second part. See the foreword by Roger Wets for further details on the topical coverage. Each chapter represents state-of-the-art research and all chapters have been carefully peer-reviewed.
Biežāk uzdotie jautājumi par e-grāmatām