Optimizing dynamic investment decisions for railway systems protection
From MaRDI portal
Publication:320718
DOI10.1016/j.ejor.2015.07.025zbMath1346.90228OpenAlexW1164095155MaRDI QIDQ320718
Stefano Starita, Maria Paola Scaparra
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://kar.kent.ac.uk/49607/1/StaritaScaparraEJOR2016.pdf
Mixed integer programming (90C11) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90)
Related Items (9)
An exact method for binary fortification games ⋮ Solving the traveling salesman problem with interdiction and fortification ⋮ Optimizing fortification plan of capacitated facilities with maximum distance limits ⋮ Radio communications interdiction problem under deterministic and probabilistic jamming ⋮ Stackelberg production-protection games: defending crop production against intentional attacks ⋮ Systems under attack-survivability rather than reliability: concept, results, and applications ⋮ An analytical approach to the protection planning of a rail intermodal terminal network ⋮ Multi-objective Stackelberg game model for water supply networks against interdictions with incomplete information ⋮ Equilibrium strategies for multiple interdictors on a common network
Cites Work
- Unnamed Item
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- A stochastic optimization model to reduce expected post-disaster response time through pre-disaster investment decisions
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- Optimizing system resilience: a facility protection model with recovery time
- Designing robust coverage networks to hedge against worst-case facility losses
- Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
- Partitioning procedures for solving mixed-variables programming problems
- Deterministic network interdiction
- A cutting plane algorithm for computing \(k\)-edge survivability of a network
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- The stochastic interdiction median problem with disruption intensity levels
- Revisiting a game theoretic framework for the robust railway network design against intentional attacks
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- A bilevel mixed-integer program for critical infrastructure protection planning
- An exact solution approach for the interdiction median problem with fortification
- Stochastic Network Interdiction
- Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
- Shortest path network interdiction with asymmetric information
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Maximizing the minimum source-sink path subject to a budget constraint
- Governments' and Terrorists' Defense and Attack in a T-Period Game
- Shortest-path network interdiction
- Removing Arcs from a Network
This page was built for publication: Optimizing dynamic investment decisions for railway systems protection
