Deterministic Network Interdiction
Deterministic Network Interdiction

Author:

Publisher:

Published: 1993

Total Pages: 20

ISBN-13:

DOWNLOAD EBOOK

Interest in network interdiction has been rekindled because of attempts to reduce the flow of drugs and precursor chemicals through river and road networks in South America. This paper considers a problem in which an enemy attempts to maximize flow through a capacitated network while an interdictor tries to minimize this maximum flow by interdicting (stopping flow on) network arcs using limited resources. This problem is shown to be NP-complete even when the interdiction of an arc requires exactly one unit of resource. New, flexible integer programming models are developed for the problem and its variations, and valid inequalities and a reformulation are derived to tighten the LP relaxation of some of these models. A small computational example from the literature illustrates a hybrid (partly directed and partly undirected) model and the usefulness of the valid inequalities and the reformulation.

Computational Methods for Deterministic and Stochastic Network Interdiction Problems
Computational Methods for Deterministic and Stochastic Network Interdiction Problems

Author: Kelly James Cormican

Publisher:

Published: 1995

Total Pages: 61

ISBN-13:

DOWNLOAD EBOOK

Using limited resources, a network interdictor attempts to disable components of a capacitated network with the objective of minimizing the maximum network flow achievable by the network user. This problem has applications to reducing the importation of illegal drugs and planning wartime air attacks against an enemy's supply lines. A deterministic model using Benders decomposition is developed and improved upon with an original "flow-dispersion heuristic." An extension is made to accommodate probabilistic scenarios, where each scenario is an estimate of uncertain arc capacities in the actual network. A unique sequential- approximation algorithm is utilized to investigate cases where interdiction successes are binary random variables. For a network of 3200 nodes and 6280 arcs, Benders decomposition solves the network interdiction problem in less than one-third of the time required by a direct branch-and-bound method. The flow-dispersion heuristic can decrease solution time to one-fifth or less of that required for the Benders decomposition algorithm alone. With six allowable but uncertain interdictions in a network of 100 nodes and 84 possible interdiction sites among 180 arcs, a stochastic network interdiction problem is solved to optimality in 24 minutes on a IBM RISC/6000 Model 590. With uncertain arc capacities in five scenarios, and three allowable and certain interdictions, a 900 node and 1740 arc network is solved to optimality in 17 minutes on a 60MHZ Pentium PC.

Computational Methods for Deterministic and Stochastic Network Interdiction Problems
Computational Methods for Deterministic and Stochastic Network Interdiction Problems

Author: Kelly James Cormican

Publisher:

Published: 1995

Total Pages: 0

ISBN-13:

DOWNLOAD EBOOK

Using limited resources, a network interdictor attempts to disable components of a capacitated network with the objective of minimizing the maximum network flow achievable by the network user. This problem has applications to reducing the importation of illegal drugs and planning wartime air attacks against an enemy's supply lines. A deterministic model using Benders decomposition is developed and improved upon with an original "flow-dispersion heuristic." An extension is made to accommodate probabilistic scenarios, where each scenario is an estimate of uncertain arc capacities in the actual network. A unique sequential- approximation algorithm is utilized to investigate cases where interdiction successes are binary random variables. For a network of 3200 nodes and 6280 arcs, Benders decomposition solves the network interdiction problem in less than one-third of the time required by a direct branch-and-bound method. The flow-dispersion heuristic can decrease solution time to one-fifth or less of that required for the Benders decomposition algorithm alone. With six allowable but uncertain interdictions in a network of 100 nodes and 84 possible interdiction sites among 180 arcs, a stochastic network interdiction problem is solved to optimality in 24 minutes on a IBM RISC/6000 Model 590. With uncertain arc capacities in five scenarios, and three allowable and certain interdictions, a 900 node and 1740 arc network is solved to optimality in 17 minutes on a 60MHZ Pentium PC.

Network Interdiction and Stochastic Integer Programming
Network Interdiction and Stochastic Integer Programming

Author: David L. Woodruff

Publisher: Springer Science & Business Media

Published: 2006-04-11

Total Pages: 134

ISBN-13: 030648109X

DOWNLOAD EBOOK

On March 15, 2002 we held a workshop on network interdiction and the more general problem of stochastic mixed integer programming at the University of California, Davis. Jesús De Loera and I co-chaired the event, which included presentations of on-going research and discussion. At the workshop, we decided to produce a volume of timely work on the topics. This volume is the result. Each chapter represents state-of-the-art research and all of them were refereed by leading investigators in the respective fields. Problems - sociated with protecting and attacking computer, transportation, and social networks gain importance as the world becomes more dep- dent on interconnected systems. Optimization models that address the stochastic nature of these problems are an important part of the research agenda. This work relies on recent efforts to provide methods for - dressing stochastic mixed integer programs. The book is organized with interdiction papers first and the stochastic programming papers in the second part. A nice overview of the papers is provided in the Foreward written by Roger Wets.

Integer Programming and Combinatorial Optimization
Integer Programming and Combinatorial Optimization

Author: Michel Goemans

Publisher: Springer

Published: 2013-03-12

Total Pages: 409

ISBN-13: 3642366945

DOWNLOAD EBOOK

This book constitutes the proceedings of the 16th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2013, held in Valparaíso, Chile, in March 2013. The 33 full papers presented were carefully reviewed and selected from 98 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization with the aim to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.

Handbook of OR/MS Models in Hazardous Materials Transportation
Handbook of OR/MS Models in Hazardous Materials Transportation

Author: Rajan Batta

Publisher: Springer Science & Business Media

Published: 2013-06-06

Total Pages: 297

ISBN-13: 1461467942

DOWNLOAD EBOOK

The Pipeline and Hazardous Materials Safety Administration of the U.S. Department of Transportation defines hazardous materials (hazmat) as a substance or material capable of posing an unreasonable risk to health, safety, or property when transported in commerce. Hazmat accidents can result in significant impact to the population (death, injuries) and damage to the environment (destroyed or damaged buildings and infrastructure). Further, hazmat, especially explosive materials, can potentially be used by terrorists to attack civilians or to destroy critical infrastructure. This handbook provides models from Operations Research and Management Science that study various activities involving hazmat transportation: risk assessment, route planning, location decisions, evacuation planning, and emergency planning for terrorist attacks. There are two important research areas in hazmat transportation that are widely studied in the literature: risk assessment and shipment planning. In the risk assessment area, important issues include measurement of accident probabilities and consequences in hazmat transport. Example works in the risk assessment area include modeling risk probability distribution over given areas, considering hazmat types and transport modes, and environmental conditions. The first half of this handbook covers the two fields of risk assessment and shipment planning, while the second half of this handbook provides useful models and insights on other important issues including location problems for undesirable facilities, network interdiction, terrorist attack, and evacuation.

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Author: Prasad Raghavendra

Publisher: Springer

Published: 2013-08-16

Total Pages: 728

ISBN-13: 364240328X

DOWNLOAD EBOOK

This book constitutes the proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2013, and the 17th International Workshop on Randomization and Computation, RANDOM 2013, held in August 2013 in the USA. The total of 48 carefully reviewed and selected papers presented in this volume consist of 23 APPROX papers selected out of 46 submissions, and 25 RANDOM papers selected out of 52 submissions. APPROX 2013 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM 2013 focuses on applications of randomness to computational and combinatorial problems.

Algorithms and Complexity
Algorithms and Complexity

Author: Vangelis Th. Paschos

Publisher: Springer

Published: 2015-05-15

Total Pages: 443

ISBN-13: 3319181734

DOWNLOAD EBOOK

This book constitutes the refereed conference proceedings of the 9th International Conference on Algorithms and Complexity, CIAC 2015, held in Paris, France, in May 2015. The 30 revised full papers presented were carefully reviewed and selected from 93 submissions and are presented together with 2 invited papers. The papers present original research in the theory and applications of algorithms and computational complexity.

The Science of Homeland Security
The Science of Homeland Security

Author: Sandra F. Amass

Publisher: Purdue University Press

Published: 2006

Total Pages: 240

ISBN-13: 9781557534163

DOWNLOAD EBOOK

Homeland security has occupied the news since 9/11. Still, much of the research about security risks, types of threats, and other vital data remains unsubstantiated. Using the tools that verify scientific finding, the editors have moved the issues of homeland security to a level above rhetoric and hearsay. Authors, in this volume, review the current literature, critique current information, and provide suggestions for future research in several areas. Topics in this volume include: Risk and Crisis Communication Strategies in Response to Bioterrorism; Security Issues in Water Infrastructure; Fundamental Causes of International Terrorism; Understanding, Measuring, Modeling, and Management of Risks to Homeland Security; Biosensors for Detection of Nerve Agents and Agricultural Pesticides; Detection of Bacterial Pathogens and Toxins; Anti-crop bioterrorism; and Medical Biosurveillance. This volume is a must for all who are involved with issues of homeland security from planners to administrators to researchers. The editors of this volume are members of the Purdue Homeland Security Institute, Purdue University, West Lafayette, Indiana except Daniel R. Dolk who is at the Naval Postgraduate School, Monterey, California.