Search
نمایش تعداد 1-10 از 14
Legal Possessions and Rights Abusers from the Perspective of Shiite
One of the rights anybody has is to be able to accomplish his civil rights. However, the law -for the benefit of the individual and that of others- in some cases limits this ability. This limitation -that is called in ...
Max-Flow Network Interdiction Problem with Reliability
The aim of the most network flow interdiction problems is to minimize the maximum flow of goods through a capacitated network. In this paper, we introduce a variation of this problem in which to each arc is associated a given reliability. Based...
An Interdiction Median Model for Hierarchical Capacitated Facilities
In this paper a partial interdiction problem on a capacitated hierarchical system is studied. We consider an attacker who can interdict facilities at different levels and each interdiction level causes a specified reduction in the capacity of a...
Interdiction problem as a tool to identify an effective budget allocation to quality improvement plans
in the quality of the
system performance. Consequently, this problem is studied in the framework of interdiction
problem. To solve the multi-objective model, the weighting-sum approach is applied. The first
interdictor’s objective function...
A bi-level partial interdiction problem on hierarchical facilities
In this paper a partial interdiction problem on a capacitated hierarchical system is studied. We consider an attacker who can interdict facilities at different levels and each interdiction level causes a specified reduction in the capacity of a...
Maximum Dynamic Flow Interdiction Problem
Maximum dynamic flow interdiction problem
Let G = (N, A) be a directed graph with a given source node s, and
a given sink node t. Let N = (G, u, τ, r) be the associated dynamic network
with arc capacities u, flow traversal times...
A bi-level programming model for protection of hierarchical facilities under imminent attacks
and safety. This paper presents a bi-level formulation of the r-interdiction median problem with fortification for critical hierarchical facilities. In the developed bi-level formulation, the defender, as the leader, decides to protect a certain number...
Two Extended Formulations for Cardinality Maximum Flow Network Interdiction Problem
We consider the maximum flow network interdiction problem in its cardinality case. There is an integer programming model for this problem byWood (Math Comput Model 17 (1993), 1–18). Two types of valid inequalities have also been proposed (Altner et...
Maximal Covering Location Problem with Different Levels of interdiction
In this paper we introduce an interdiction problem for a maximal covering location problem in which an interdictor can attack each facility in different levels. The system includes real and dummy facilities in candidate locations and also identifies...
A bi-level programming formulation and a hybrid K-means algorithm for identifying the optimal customer satisfaction scheme under attack
malicious interdictor as the leader and a system defender as the follower. In the upper level problem (ULP), the
most destructive interdiction strategy in the presence of limitation on the maximum available interdiction budget is detected...