The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability.
Douglas S. AltnerÖzlem ErgunNelson A. UhanPublished in: Oper. Res. Lett. (2010)
Keyphrases
- valid inequalities
- maximum flow
- mixed integer
- flow network
- linear programming relaxation
- integer programming
- linear programming
- mixed integer programming
- traveling salesman problem
- integer program
- network design problem
- lp relaxation
- feasible solution
- linear program
- convex hull
- cutting plane
- directed graph
- approximation algorithms
- lot sizing
- lower and upper bounds
- column generation
- primal dual
- optimal solution
- np hard
- continuous variables
- facet defining inequalities
- lagrangian relaxation
- lower bound
- mathematical programming
- network flow problem
- mathematical model
- evolutionary algorithm