Valid inequalities and separation for capacitated fixed charge flow problems Original Research Article

This paper discusses a simple procedure to derive network inequalities for capacitated fixed charge network problems. Properties of the fractional extreme points of the LP relaxation are used to construct a class of inequalities and to construct a computational heuristic procedure for generating violated cutting planes. Computational results confirm the usefulness of the procedure.