Tightening simple mixed-integer sets with guaranteed bounds

In this paper we consider 0/1 knapsack sets and certain simple fixed-charge network flow sets. The study of such sets is relevant in that a popular approach for solving general mixed-integer programs consists of selecting a subset of constraints with particular structure (such as a single-node fixedcharge flow problem) and tightening that part of the… CONTINUE READING