Name
Abstract | ||
|---|---|---|
We propose to solve the adaptive network flow problem via a bilevel optimization framework. In this problem, we aim to find a flow that is most robust against any k edges attack. There is an exact algorithm proposed to solve the problem in a specific class of input graphs. However, for some input graphs that are not in that class, a flow obtained from the algorithms is sometimes much less robust than the optimal one. That motivates us to find an efficient exact algorithm based on bilevel optimization framework for the problem in this paper. The framework can give us much better results using reasonable amount of times. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.endm.2018.01.012 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
adaptive network flow problem,network interdiction problem,bilevel optimization framework | Flow network,Graph,Discrete mathematics,Mathematical optimization,Exact algorithm,Bilevel optimization,Flow (psychology),Mathematics | Journal |
Volume | ISSN | Citations |
64 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jean-François Baffier | 1 | 14 | 4.80 |
| Pierre-Louis Poirion | 2 | 24 | 7.43 |
| Vorapong Suppakitpaisarn | 3 | 28 | 13.11 |