강건 최대 흐름 네트워크 공격 문제의 최적화 해법

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 558
  • Download : 0
This paper considers maximum flow network interdiction problem (MFNIP), which is to minimize the maximum flow from a node to another node by interdicting the arcs with limited resources available in the capacitated directed network. To reflect the uncertainties in the amount of resources needed to attack, a robust maximum flow network interdiction problem was designed through the robust optimization technique. In order to solve the problem, an algorithm using combinatorial Benders’ cuts was proposed. The computational experiences were reported by using the algorithm on randomly generated grid networks.
Publisher
화랑대연구소
Issue Date
2013-10
Language
Korean
Citation

한국군사학논집, v.69, no.3, pp.235 - 257

ISSN
2005-2715
URI
http://hdl.handle.net/10203/201516
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0