Interdicting facilities in tree networks
From MaRDI portal
Publication:2121611
DOI10.1007/s11750-021-00600-6zbMath1490.90243OpenAlexW3160980171MaRDI QIDQ2121611
Nicolas Fröhlich, Stefan Ruzika
Publication date: 4 April 2022
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-021-00600-6
Trees (05C05) Combinatorial optimization (90C27) Dynamic programming (90C39) Discrete location and assignment (90B80)
Cites Work
- Unnamed Item
- The budget constrained \(r\)-interdiction median problem with capacity expansion
- Interdiction problems on planar graphs
- On short paths interdiction problems: Total and node-wise limited interdiction
- Network flow interdiction on planar graphs
- Robust facility location
- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
- The maximum clique interdiction problem
- An implicit enumeration algorithm for the hub interdiction median problem with fortification
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
- Connectivity interdiction
- Deterministic network interdiction
- Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems
- On the hardness of covering-interdiction problems
- The multicriteria \(p\)-facility median location problem on networks
- A survey of network interdiction models and algorithms
- An exact solution approach for the interdiction median problem with fortification
- A survey of variants and extensions of the location-routing problem
- On the \(p\)-hub interdiction problem
- Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives
- Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
- The Knapsack Problem with Conflict Graphs
- Hardness and approximation for network flow interdiction
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
- Shortest-path network interdiction
- Packing Interdiction and Partial Covering Problems
- Multilevel Approaches for the Critical Node Problem
- Location Science
- A special class of extended multicriteria location problems
- The network inhibition problem
- The Theory and Computation of Knapsack Functions
- A Backward Sampling Framework for Interdiction Problems with Fortification
This page was built for publication: Interdicting facilities in tree networks