FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4200499328> ?p ?o ?g. }

• W4200499328 endingPage "1290" @default.
• W4200499328 startingPage "1272" @default.
• W4200499328 abstract "This study generalizes the r-interdiction median (RIM) problem with fortification to simultaneously consider two types of risks: probabilistic exogenous disruptions and endogenous disruptions caused by intentional attacks. We develop a bilevel programming model that includes a lower-level interdiction problem and a higher-level fortification problem to hedge against such risks. We then prove that the interdiction problem is supermodular and subsequently adopt the cuts associated with supermodularity to develop an efficient cutting-plane algorithm to achieve exact solutions. For the fortification problem, we adopt the logic-based Benders decomposition (LBBD) framework to take advantage of the two-level structure and the property that a facility should not be fortified if it is not attacked at the lower level. Numerical experiments show that the cutting-plane algorithm is more efficient than benchmark methods in the literature, especially when the problem size grows. Specifically, with regard to the solution quality, LBBD outperforms the greedy algorithm in the literature with an up-to 13.2% improvement in the total cost, and it is as good as or better than the tree-search implicit enumeration method. Summary of Contribution: This paper studies an r-interdiction median problem with fortification (RIMF) in a supply chain network that simultaneously considers two types of disruption risks: random disruptions that occur probabilistically and disruptions caused by intentional attacks. The problem is to determine the allocation of limited facility fortification resources to an existing network. It is modeled as a bilevel programming model combining a defender’s problem and an attacker’s problem, which generalizes the r-interdiction median problem with probabilistic fortification. This paper is suitable for IJOC in mainly two aspects: (1) The lower-level attacker’s interdiction problem is a challenging high-degree nonlinear model. In the literature, only a total enumeration method has been applied to solve a special case of this problem. By exploring the special structural property of the problem, namely, the supermodularity of the transportation cost function, we developed an exact cutting-plane method to solve the problem to its optimality. Extensive numerical studies were conducted. Hence, this paper fits in the intersection of operations research and computing. (2) We developed an efficient logic-based Benders decomposition algorithm to solve the higher-level defender’s fortification problem. Overall, this study generalizes several important problems in the literature, such as RIM, RIMF, and RIMF with probabilistic fortification (RIMF-p)." @default.
• W4200499328 created "2021-12-31" @default.
• W4200499328 creator A5044154450 @default.
• W4200499328 creator A5055364261 @default.
• W4200499328 creator A5061830189 @default.
• W4200499328 date "2022-03-01" @default.
• W4200499328 modified "2023-09-28" @default.
• W4200499328 title "Efficient Solution Methods for a General r-Interdiction Median Problem with Fortification" @default.
• W4200499328 cites W1483918358 @default.
• W4200499328 cites W1508945008 @default.
• W4200499328 cites W1563601717 @default.
• W4200499328 cites W1968766531 @default.
• W4200499328 cites W1978686733 @default.
• W4200499328 cites W2015661661 @default.
• W4200499328 cites W2041504512 @default.
• W4200499328 cites W2045540560 @default.
• W4200499328 cites W2050511894 @default.
• W4200499328 cites W2058892733 @default.
• W4200499328 cites W2061495609 @default.
• W4200499328 cites W2061824110 @default.
• W4200499328 cites W2067259170 @default.
• W4200499328 cites W2067295913 @default.
• W4200499328 cites W2068502869 @default.
• W4200499328 cites W2076484073 @default.
• W4200499328 cites W2080368021 @default.
• W4200499328 cites W2081681547 @default.
• W4200499328 cites W2127685347 @default.
• W4200499328 cites W2134798735 @default.
• W4200499328 cites W2144463094 @default.
• W4200499328 cites W2155184100 @default.
• W4200499328 cites W2405230269 @default.
• W4200499328 cites W2505968561 @default.
• W4200499328 cites W2560324934 @default.
• W4200499328 cites W2728398104 @default.
• W4200499328 cites W3121568017 @default.
• W4200499328 doi "https://doi.org/10.1287/ijoc.2021.1111" @default.
• W4200499328 hasPublicationYear "2022" @default.
• W4200499328 type Work @default.
• W4200499328 citedByCount "0" @default.
• W4200499328 crossrefType "journal-article" @default.
• W4200499328 hasAuthorship W4200499328A5044154450 @default.
• W4200499328 hasAuthorship W4200499328A5055364261 @default.
• W4200499328 hasAuthorship W4200499328A5061830189 @default.
• W4200499328 hasConcept C124119293 @default.
• W4200499328 hasConcept C126255220 @default.
• W4200499328 hasConcept C127413603 @default.
• W4200499328 hasConcept C13280743 @default.
• W4200499328 hasConcept C137631369 @default.
• W4200499328 hasConcept C137836250 @default.
• W4200499328 hasConcept C144237770 @default.
• W4200499328 hasConcept C146978453 @default.
• W4200499328 hasConcept C154945302 @default.
• W4200499328 hasConcept C185798385 @default.
• W4200499328 hasConcept C199510392 @default.
• W4200499328 hasConcept C205649164 @default.
• W4200499328 hasConcept C3309286 @default.
• W4200499328 hasConcept C33923547 @default.
• W4200499328 hasConcept C41008148 @default.
• W4200499328 hasConcept C49937458 @default.
• W4200499328 hasConceptScore W4200499328C124119293 @default.
• W4200499328 hasConceptScore W4200499328C126255220 @default.
• W4200499328 hasConceptScore W4200499328C127413603 @default.
• W4200499328 hasConceptScore W4200499328C13280743 @default.
• W4200499328 hasConceptScore W4200499328C137631369 @default.
• W4200499328 hasConceptScore W4200499328C137836250 @default.
• W4200499328 hasConceptScore W4200499328C144237770 @default.
• W4200499328 hasConceptScore W4200499328C146978453 @default.
• W4200499328 hasConceptScore W4200499328C154945302 @default.
• W4200499328 hasConceptScore W4200499328C185798385 @default.
• W4200499328 hasConceptScore W4200499328C199510392 @default.
• W4200499328 hasConceptScore W4200499328C205649164 @default.
• W4200499328 hasConceptScore W4200499328C3309286 @default.
• W4200499328 hasConceptScore W4200499328C33923547 @default.
• W4200499328 hasConceptScore W4200499328C41008148 @default.
• W4200499328 hasConceptScore W4200499328C49937458 @default.
• W4200499328 hasIssue "2" @default.
• W4200499328 hasLocation W42004993281 @default.
• W4200499328 hasOpenAccess W4200499328 @default.
• W4200499328 hasPrimaryLocation W42004993281 @default.
• W4200499328 hasRelatedWork W2016379082 @default.
• W4200499328 hasRelatedWork W2020507817 @default.
• W4200499328 hasRelatedWork W2131023196 @default.
• W4200499328 hasRelatedWork W2335727710 @default.
• W4200499328 hasRelatedWork W2895841339 @default.
• W4200499328 hasRelatedWork W2900321892 @default.
• W4200499328 hasRelatedWork W3157498319 @default.
• W4200499328 hasRelatedWork W3216144225 @default.
• W4200499328 hasRelatedWork W4200499328 @default.
• W4200499328 hasRelatedWork W4289302881 @default.
• W4200499328 hasVolume "34" @default.
• W4200499328 isParatext "false" @default.
• W4200499328 isRetracted "false" @default.
• W4200499328 workType "article" @default.