نتایج جستجو برای: nodal interdiction

تعداد نتایج: 19620  

Journal: :INFORMS Journal on Computing 2007
Johannes O. Royset R. Kevin Wood

W describe a new algorithm for computing the efficient frontier of the “bi-objective maximum-flow network-interdiction problem.” In this problem, an “interdictor” seeks to interdict (destroy) a set of arcs in a capacitated network that are Pareto-optimal with respect to two objectives, minimizing total interdiction cost and minimizing maximum flow. The algorithm identifies these solutions throu...

2017
Yunxiu Zeng Kai Xu Quanjun Yin Long Qin Yabing Zha William Yeoh

Goal recognition is the task of inferring an agent’s goals given some or all of the agent’s observed actions. Among different ways of problem formulation, goal recognition can be solved as a model-based planning problem using off-theshell planners. However, obtaining accurate cost or reward models of an agent and incorporating them into the planning model becomes an issue in real applications. ...

Journal: :INFORMS Journal on Computing 2016
Yongjia Song Siqian Shen

We consider a Stackelberg game in a network, where a leader minimizes the cost of interdicting arcs and a follower seeks the shortest distance between given origin and destination nodes under uncertain arc traveling cost. In particular, we consider a risk-averse leader, who aims to keep high probability that the follower’s traveling distance is longer than a given threshold, interpreted by a ch...

Journal: :Networks 2008
Udom Janjarassuk Jeff T. Linderoth

The Network Interdiction Problem involves interrupting an adversary’s ability to maximize flow through a capacitated network by destroying portions of the network. A budget constraint limits the amount of the network that can be destroyed. In this paper, we study a stochastic version of the network interdiction problem in which the successful destruction of an arc of the network is a Bernoulli ...

2011
Sunghoon Hong Enrico Mattei Carlo Carraro

We develop a strategic model of network interdiction in a non-cooperative game of flow. An adversary, endowed with a bounded quantity of bads, chooses a flow specifying a plan for carrying bads through a network from a base to a target. Simultaneously, an agency chooses a blockage specifying a plan for blocking the transport of bads through arcs in the network. The bads carried to the target ca...

2016
Michael R. Bartolacci Stanko Dimitrov

Disasters, whether natural or manmade, and other types of emergencies create the need for immediate and secure communications between and among the affected populace, governmental agencies, non-governmental organizations (NGOs) and other types of emergency responders. It is through these communications that the affected populace is able to show resilient behavior, both psychologically and econo...

Journal: :Refuge: Canada's Journal on Refugees 2001

Journal: :The Journal of Criminal Law and Criminology (1973-) 1992

2017
Michael P. Atkinson Moshe Kress Roberto Szechtman

We analyze an interdiction scenario where an interceptor attempts to catch an intruder as the intruder moves through the area of interest. A motivating example is the detection and interdiction of drug smuggling vessels in the Eastern Pacific and Caribbean. We study two models in this paper. The first considers a non-strategic target that moves through the area without taking evasive action to ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید