SCL SEMINAR SERIES :: Local Search in Maximum Flow Network Interdiction

Primary tabs

We investigate the effectiveness of local search for the Maximum Flow Network Interdiction Problem (MFNIP). Our goal is to develop powerful meta-heuristics that consistently obtain good solutions in a timely fashion. In this talk, some results on the integrality gap of Wood's formulation of MFNIP will be discussed along with two neighborhoods. The first is a node-flip neighborhood that focuses on cut-sets and the second is an arc-flip neighborhood that focuses on maximum flows.


  • Workflow Status: Published
  • Created By: Barbara Christopher
  • Created: 10/08/2010
  • Modified By: Fletcher Moore
  • Modified: 10/07/2016


No keywords were submitted.

Target Audience