File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.cor.2017.09.004
- Scopus: eid_2-s2.0-85029820229
- WOS: WOS:000414884300009
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Stochastic maximum flow interdiction problems under heterogeneous risk preferences
Title | Stochastic maximum flow interdiction problems under heterogeneous risk preferences |
---|---|
Authors | |
Keywords | Conditional value-at-Risk (CVar) Maximum flow interdiction Mixed-integer linear programming Risk-averse optimization Stochastic programming |
Issue Date | 2018 |
Citation | Computers and Operations Research, 2018, v. 90, p. 97-109 How to Cite? |
Abstract | We consider a generic maximum flow interdiction problem that involves a leader and a follower who take actions in sequence. Given an interdiction budget, the leader destroys a subset of arcs to minimize the follower's maximum flows from a source to a sink node. The effect from an interdiction action taken on each arc is random, following a given success rate of decreasing the arc's capacity to zero. The follower can add additional arc capacities for mitigating flow losses, after knowing the leader's interdiction plan but before realizing the uncertainty. We consider risk-neutral and risk-averse behaviors of the two players and investigate five bi-level/tri-level programming models for different risk-preference combinations. The models incorporate the expectation, left-tail, and right-tail Conditional Value-at-Risk (CVaR) as commonly used convex risk measures for evaluating random maximum flows in the leader's and follower's objectives. We reformulate each model as an equivalent mixed-integer linear program and test them on real-world network instances to demonstrate interactions between the leader and the follower under various risk-preference settings. |
Persistent Identifier | http://hdl.handle.net/10722/323126 |
ISSN | 2023 Impact Factor: 4.1 2023 SCImago Journal Rankings: 1.574 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lei, Xiao | - |
dc.contributor.author | Shen, Siqian | - |
dc.contributor.author | Song, Yongjia | - |
dc.date.accessioned | 2022-11-18T11:54:55Z | - |
dc.date.available | 2022-11-18T11:54:55Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | Computers and Operations Research, 2018, v. 90, p. 97-109 | - |
dc.identifier.issn | 0305-0548 | - |
dc.identifier.uri | http://hdl.handle.net/10722/323126 | - |
dc.description.abstract | We consider a generic maximum flow interdiction problem that involves a leader and a follower who take actions in sequence. Given an interdiction budget, the leader destroys a subset of arcs to minimize the follower's maximum flows from a source to a sink node. The effect from an interdiction action taken on each arc is random, following a given success rate of decreasing the arc's capacity to zero. The follower can add additional arc capacities for mitigating flow losses, after knowing the leader's interdiction plan but before realizing the uncertainty. We consider risk-neutral and risk-averse behaviors of the two players and investigate five bi-level/tri-level programming models for different risk-preference combinations. The models incorporate the expectation, left-tail, and right-tail Conditional Value-at-Risk (CVaR) as commonly used convex risk measures for evaluating random maximum flows in the leader's and follower's objectives. We reformulate each model as an equivalent mixed-integer linear program and test them on real-world network instances to demonstrate interactions between the leader and the follower under various risk-preference settings. | - |
dc.language | eng | - |
dc.relation.ispartof | Computers and Operations Research | - |
dc.subject | Conditional value-at-Risk (CVar) | - |
dc.subject | Maximum flow interdiction | - |
dc.subject | Mixed-integer linear programming | - |
dc.subject | Risk-averse optimization | - |
dc.subject | Stochastic programming | - |
dc.title | Stochastic maximum flow interdiction problems under heterogeneous risk preferences | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1016/j.cor.2017.09.004 | - |
dc.identifier.scopus | eid_2-s2.0-85029820229 | - |
dc.identifier.volume | 90 | - |
dc.identifier.spage | 97 | - |
dc.identifier.epage | 109 | - |
dc.identifier.isi | WOS:000414884300009 | - |