Convex hull representation of the deterministic bipartite network interdiction problem

DOI10.1007/S10107-013-0650-3zbMath1312.90042OpenAlexW2141525740MaRDI QIDQ2248756

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

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

reformulation-linearization techniquenetwork interdictionconvex hull representation

Mathematics Subject Classification ID

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

Related Items (3)

Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction ⋮ A survey on bilevel optimization under uncertainty ⋮ A survey of network interdiction models and algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The k most vital arcs in the shortest path problem
• Most vital links and nodes in weighted networks
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• Tight formulations for some simple mixed integer programs and convex objective integer programs
• Deterministic network interdiction
• Finding the most vital arcs in a network
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Survivable network design under optimal and heuristic interdiction scenarios
• SPAR: Stochastic Programming with Adversarial Recourse
• Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
• Stochastic Network Interdiction
• Minimizing a stochastic maximum-reliability path
• Reformulation and sampling to solve a stochastic network interdiction problem
• Shortest path network interdiction with asymmetric information
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Finding the n Most Vital Links in Flow Networks
• Finding the n Most Vital Nodes in a Flow Network
• Maximizing the minimum source-sink path subject to a budget constraint
• A problem in network interdiction
• Securing a border under asymmetric information
• Deception tactics for network interdiction: A multiobjective approach
• Shortest-path network interdiction
• Removing Arcs from a Network
• Optimal interdiction policy for a flow network
• Optimal interdiction of a supply network
• Determining the most vital link in a flow network
• The mixed vertex packing problem.
• Mixing mixed-integer inequalities

This page was built for publication: Convex hull representation of the deterministic bipartite network interdiction problem