Valid inequalities for problems with additive variable upper bounds

The facial structure of a polyhedron associated with the single node relaxation of network flow problems with additive variable upper bounds is studied to derive two classes of valid inequalities that are very effective in improving the quality of the linear programming relaxations.