지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 발행연도
- 2013.10
- 수록면
- 235 - 257 (23page)
이용수
초록· 키워드
오류제보하기
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.
목차
등록된 정보가 없습니다.
참고문헌 (10)
참고문헌 신청
1. [학위논문] - 이바로 / 2010 / 강건 최대 흐름 네트워크 공격 문제의 최적화 해법 / 석사 / 한국과학기술원
2. [학술지(정기간행물)] - Bertsimas, D. / 2004 / The price of robustness / Operations Research 52 (1) : 35 ~ 53
3. [학위논문] - Bingol, L. / 2001 / A Lagrangian Heuristic for Solving a Network Interdiction Problem / 석사 / Naval Postgraduate School
4. [학술지(정기간행물)] - Codato, G. / 2006 / Combinatorial Benders’ Cuts for Mixed-Integer Linear Programming / Operations Research 53 (4) : 756 ~ 766
5. [학술지(정기간행물)] - Colson, B. / 2007 / An overview of bilevel optimization / Annals of Operations Research 153 (1) : 235 ~ 256
2. [학술지(정기간행물)] - Bertsimas, D. / 2004 / The price of robustness / Operations Research 52 (1) : 35 ~ 53
3. [학위논문] - Bingol, L. / 2001 / A Lagrangian Heuristic for Solving a Network Interdiction Problem / 석사 / Naval Postgraduate School
4. [학술지(정기간행물)] - Codato, G. / 2006 / Combinatorial Benders’ Cuts for Mixed-Integer Linear Programming / Operations Research 53 (4) : 756 ~ 766
5. [학술지(정기간행물)] - Colson, B. / 2007 / An overview of bilevel optimization / Annals of Operations Research 153 (1) : 235 ~ 256
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2018-039-001936070