Valid Inequalities and Separation for Capacitated Fixed Charge Flow Problems.

Published in: Discret. Appl. Math. (2000)

Keyphrases

capacitated fixed charge
network design problem
valid inequalities
mixed integer programming
integer programming
network design
approximation algorithms
cutting plane
linear programming
np complete
integer program
traveling salesman problem
objective function
combinatorial optimization
convex hull