Interdicting the activities of a linear program -- a parametric analysis
From MaRDI portal
Publication:1390246
DOI10.1016/0377-2217(94)00057-JzbMath0914.90247OpenAlexW2076404695MaRDI QIDQ1390246
Maw-Sheng Chern, Kao-Chêng Lin
Publication date: 23 June 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)00057-j
Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Deterministic network models in operations research (90B10)
Related Items
Parametric matroid interdiction, Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The k most vital arcs in the shortest path problem
- Most vital links and nodes in weighted networks
- Finding the most vital arcs in a network
- Characterization of all optimal solutions and parametric maximal mows in networks
- Maximizing the minimum source-sink path subject to a budget constraint
- A problem in network interdiction
- Optimal interdiction of a supply network