Convex hull representation of the deterministic bipartite network interdiction problem

DOI10.1007/S10107-013-0650-3MaRDI QIDQ2248756zbMATH OpenOpenAlexFDO

Authors Kelly M. Sullivan, J. Cole Smith, David Morton

Publication date 27 June 2014

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-013-0650-3

zbMATH Keywords

convex hull representationnetwork interdictionreformulation-linearization technique

Mathematics Subject Classification ID

Integer programming (90C10) Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 2050723
• Deterministic network interdiction
• Minimizing a stochastic maximum-reliability path
• New solution approaches for the maximum-reliability stochastic network interdiction problem
• Shortest-path network interdiction

Cites work

• 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

Cited in

(6)

• 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)