An exact method for nonlinear network flow interdiction problems
From MaRDI portal
Recommendations
Cites work
- A bilevel approach for identifying the worst contingencies for nonconvex alternating current power systems
- A bilevel optimization approach to decide the feasibility of bookings in the European gas market
- A generic optimization framework for resilient systems
- A reduction technique for natural gas transmission network optimization problems
- A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid
- A survey of network interdiction models and algorithms
- A survey on mixed-integer programming techniques in bilevel optimization
- Algorithmic results for potential‐based flows: Easy and hard cases
- Combinatorial acyclicity models for potential‐based flows
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Electrical transmission system cascades and vulnerability. An operations research viewpoint
- Hardness and approximation for network flow interdiction
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid
- Pyomo -- optimization modeling in Python
- Solving the Pipe Network Analysis Problem Using Optimization Techniques
- The N-k problem in power grids: new models, formulations, and numerical experiments
- The specialized MINLP approach
Cited in
(2)
This page was built for publication: An exact method for nonlinear network flow interdiction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644845)