Two extended formulations for cardinality maximum flow network interdiction problem

DOI10.1002/NET.21732MaRDI QIDQ4638579zbMATH OpenOpenAlexFDO

Authors Maria Afsharirad, Hossein Taghizadeh Kakhki

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 gapextended formulationvalid inequalitymaximum flow network interdictionvalid separation

Mathematics Subject Classification ID

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

Recommendations

• The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
• Deterministic network interdiction
• The multi-terminal maximum-flow network-interdiction problem
• Exact algorithms for solving a Euclidean maximum flow network interdiction problem
• The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs

Cited in

(9)

• Minimum cost edge blocker clique problem
• Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
• A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
• Exact algorithms for the minimum cost vertex blocker clique problem
• Maximum Capacity Path Interdiction Problem with Fixed Costs
• b-matching interdiction problem on bipartite graphs with unit weight and multi-dimensional budgets
• On designing networks resilient to clique blockers
• An extended formulation for the 1‐wheel inequalities of the stable set polytope
• The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4638579)