Optimizing dynamic investment decisions for railway systems protection
From MaRDI portal
Publication:320718
Recommendations
- An analytical approach to the protection planning of a rail intermodal terminal network
- Analysing stability and investments in railway networks using advanced evolutionary algorithms
- An iterative approach for reducing the impact of infrastructure maintenance on the performance of railway systems
- Optimization of investments in rail-highway crossings
- Multi-objective model for optimizing railway infrastructure asset renewal
- Recoverable robustness for railway rolling stock planning
- Selecting rail grade crossing investments with a decision support system
Cites work
- scientific article; zbMATH DE number 2050723 (Why is no real title available?)
- A bilevel mixed-integer program for critical infrastructure protection planning
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- A cutting plane algorithm for computing \(k\)-edge survivability of a network
- A stochastic optimization model to reduce expected post-disaster response time through pre-disaster investment decisions
- An exact solution approach for the interdiction median problem with fortification
- Designing robust coverage networks to hedge against worst-case facility losses
- Deterministic network interdiction
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Governments' and terrorists' defense and attack in a \(T\)-period game
- Maximizing the minimum source-sink path subject to a budget constraint
- Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Optimizing system resilience: a facility protection model with recovery time
- Partitioning procedures for solving mixed-variables programming problems
- Removing Arcs from a Network
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- Revisiting a game theoretic framework for the robust railway network design against intentional attacks
- Shortest path network interdiction with asymmetric information
- Shortest-path network interdiction
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- Solving the bi-objective maximum-flow network-interdiction problem
- Stochastic network interdiction
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- The stochastic interdiction median problem with disruption intensity levels
Cited in
(13)- An exact method for binary fortification games
- Radio communications interdiction problem under deterministic and probabilistic jamming
- Revisiting a game theoretic framework for the robust railway network design against intentional attacks
- An analytical approach to the protection planning of a rail intermodal terminal network
- Systems under attack-survivability rather than reliability: concept, results, and applications
- Equilibrium strategies for multiple interdictors on a common network
- Solving the traveling salesman problem with interdiction and fortification
- Minimizing investment risk of integrated rail and transit-oriented-development projects over years in a linear monocentric city
- Stackelberg production-protection games: defending crop production against intentional attacks
- Optimization of investments in rail-highway crossings
- Optimizing fortification plan of capacitated facilities with maximum distance limits
- Safety investment decision problem without probability distribution: a robust optimization approach
- Multi-objective Stackelberg game model for water supply networks against interdictions with incomplete information
This page was built for publication: Optimizing dynamic investment decisions for railway systems protection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320718)
