Convex hull representation of the deterministic bipartite network interdiction problem
The authors consider an asymmetric bipartite stochastic network interdiction problem. Here, the follower seeks a maximum reliability path (crossing a border) from an unknown origin to an unknown destination through a transportation network. The leader places a limited number of sensors on border crossing arcs in order to minimize the follower's probability of traversing the network successfully. The uncertainty in origin and destination is modelled by optimizing against a number of followers. The authors present a formulation for the one opponent model and through developing several classes of facet defining inequalities, provide a convex hull representation of the associated polyhedron. They also show how to derive a representation of \(\mathrm{conv}(P)\) through the special structures reformulation-linearization technique. Finally, they discuss extensions of their results for the multiple opponent problem and present some computational results.
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A problem in network interdiction
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Deception tactics for network interdiction: a multiobjective approach
- Determining the most vital link in a flow network
- Deterministic network interdiction
- Exploiting special structures in constructing a hierarchy of relaxations for 0-1 mixed integer problems
- Finding the n Most Vital Links in Flow Networks
- Finding the n Most Vital Nodes in a Flow Network
- Finding the most vital arcs in a network
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- Maximizing the minimum source-sink path subject to a budget constraint
- Minimizing a stochastic maximum-reliability path
- Mixing mixed-integer inequalities
- Most vital links and nodes in weighted networks
- Optimal interdiction of a supply network
- Optimal interdiction policy for a flow network
- Reformulation and sampling to solve a stochastic network interdiction problem
- Removing Arcs from a Network
- Securing a border under asymmetric information
- Shortest path network interdiction with asymmetric information
- Shortest-path network interdiction
- SPAR: Stochastic Programming with Adversarial Recourse
- Stochastic network interdiction
- Survivable network design under optimal and heuristic interdiction scenarios
- The k most vital arcs in the shortest path problem
- The mixed vertex packing problem.
- Tight formulations for some simple mixed integer programs and convex objective integer programs
- A survey of network interdiction models and algorithms
- On the \(p\)-hub interdiction problem
- Minimizing a stochastic maximum-reliability path
- Securing a border under asymmetric information
- Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
- A survey on bilevel optimization under uncertainty
This page was built for publication: Convex hull representation of the deterministic bipartite network interdiction problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248756)
