.png){kind=icon}
.png){kind=icon}
Return
The continuous maximum capacity path interdiction problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2022.05.028.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper studies the continuous maximum capacity path interdiction problem, where two players, user and interdictor, compete in a capacitated network. The user wants to send the maximum possible amount of flow through a path, whose capacity is given by the minimum capacity among its arcs. The budget -constrained interdictor decreases arc capacities by any continuous amount to reduce the quality of the user's chosen path. We present an efficient algorithm based on a discrete version of the Newton's method, which helps us solve the problem in polynomial time. We also prove that the problem can be transformed into a zero-sum game, which has always a pure Nash equilibrium point. We demonstrate the performance of our algorithm over a set of randomly generated networks.(c) 2022 Elsevier B.V. All rights reserved.
Keywords:
Networks
Maximum capacity path
Network interdiction
Stackelberg games
Newton?s method
Interdiction games
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W