ISMP2012 , 2012-08-19

Title : ( Maximum Dynamic Flow Interdiction Problem )

Authors: maria Afshari Rad , Hossein Taghizadeh Kakhki ,

Access to full-text not allowed by authors

Citation: BibTeX | EndNote

Abstract

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 τ, and arc interdiction costs r. The problem is to find a set of arcs whose removal will minimize the maximum flow from s to t within a given time period of T, subject to budget limitation. This is in fact the dynamic version of the well known max flow interdiction problem. We present a new formulation based on the concept of temporally repeated flows and discuss two solution approaches for this problem. Some numerical results will also be presented.

Keywords

Network Interdiction valid separation valid inequality
برای دانلود از شناسه و رمز عبور پرتال پویا استفاده کنید.

@inproceedings{paperid:1013547,
author = {Afshari Rad, Maria and Taghizadeh Kakhki, Hossein},
title = {Maximum Dynamic Flow Interdiction Problem},
booktitle = {ISMP2012},
year = {2012},
location = {برلین, GERMANY},
keywords = {Network Interdiction valid separation valid inequality},
}

[Download]

%0 Conference Proceedings
%T Maximum Dynamic Flow Interdiction Problem
%A Afshari Rad, Maria
%A Taghizadeh Kakhki, Hossein
%J ISMP2012
%D 2012

[Download]