Two extended formulations for cardinality maximum flow network interdiction problem

DOI10.1002/net.21732zbMath1386.90025OpenAlexW2587422423MaRDI QIDQ4638579

Hossein Taghizadeh Kakhki, Maria Afsharirad

Publication date: 27 April 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21732

zbMATH Keywords

integrality gapvalid inequalityextended formulationmaximum flow network interdictionvalid separation

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18)

Related Items (7)

Minimum cost edge blocker clique problem ⋮ Exact algorithms for the minimum cost vertex blocker clique problem ⋮ A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ An extended formulation for the 1‐wheel inequalities of the stable set polytope ⋮ On designing networks resilient to clique blockers ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs ⋮ Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire

This page was built for publication: Two extended formulations for cardinality maximum flow network interdiction problem