Integer Programming Formulations for Minimum Spanning Tree Interdiction
From MaRDI portal
(Redirected from Publication:5084609)
Recommendations
- A survey of network interdiction models and algorithms
- Improved formulations for minimum connectivity network interdiction problems
- Assessing the effectiveness of \(k\)-shortest path sets in problems of network interdiction
- Integer programming formulations for minimum spanning forests and connected components in sparse graphs
- Efficient solution methods for a general \(r\)-interdiction median problem with fortification
Cites work
- A Backward Sampling Framework for Interdiction Problems with Fortification
- A class of algorithms which require nonlinear time to maintain disjoint sets
- A linear programming approach to increasing the weight of all minimum spanning trees
- An Algorithm for Finding K Minimum Spanning Trees
- An integer programming framework for critical elements detection in graphs
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Collective dynamics of `small-world' networks
- Compact vs. exponential-size LP relaxations
- Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
- Detecting critical nodes in sparse graphs
- Deterministic network interdiction
- Disconnecting graphs by removing vertices: a polyhedral approach
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Efficient algorithms for finding the most vital edge of a minimum spanning tree
- Efficient determination of the k most vital edges for the minimum spanning tree problem
- Epidemic dynamics on complex networks
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Finding the k most vital edges in the minimum spanning tree problem
- Finding the most vital edge with respect to minimum spanning tree in weighted graphs
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 795222 (Why is no real title available?)
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Improved Algorithms for MST and Metric-TSP Interdiction
- Increasing the Weight of Minimum Spanning Trees
- Interdicting structured combinatorial optimization problems with {0,1}-objectives
- Matching interdiction
- Minimum edge blocker dominating set problem
- Minimum vertex blocker clique problem
- Mixed integer linear programming formulation techniques
- Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure
- Most vital links and nodes in weighted networks
- Multi-Terminal Network Flows
- Network flows. Theory, algorithms, and applications.
- Nodal interdiction
- On the History of the Minimum Spanning Tree Problem
- Optimal interdiction policy for a flow network
- Random Graphs
- Removing Arcs from a Network
- Shortest-path network interdiction
- Statistical mechanics of complex networks
- Stochastic network interdiction
- The k-separator problem: polyhedra, complexity and approximation results
- The constrained minimum spanning tree problem
- The discipline number of a graph
- The maximum clique interdiction problem
- The most vital edges in the minimum spanning tree problem
- The most vital nodes with respect to independent set and vertex cover
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Worst-case Analysis of Set Union Algorithms
Cited in
(17)- Integer programming methods for solving binary interdiction games
- Exact solution approaches for a class of bilevel fractional programs
- scientific article; zbMATH DE number 4173002 (Why is no real title available?)
- scientific article; zbMATH DE number 5621997 (Why is no real title available?)
- Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems
- Integer programming approaches for minimum stabbing problems
- Shortest path interdiction problem with convex piecewise-linear costs
- Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds
- On designing networks resilient to clique blockers
- Parametric matroid interdiction
- Shortest path network interdiction with incomplete information: a robust optimization approach
- On supervalid inequalities for binary interdiction games
- Bottleneck spanning tree interdiction problem with fixed and linear costs
- Fifty years of operations research in defense
- Target-based distributionally robust minimum spanning tree problem
- Optimal cost augmentation and interdiction problem for the minimum spanning tree
- Interdiction of minimum spanning trees and other matroid bases
This page was built for publication: Integer Programming Formulations for Minimum Spanning Tree Interdiction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084609)
