We describe a method for generating cuts for mixed-integer 0/1 programs. These cuts are designed to tighten an integer program prior to applying linear programming based branch and bound algorithms.
In this paper, we analyze a generalization of a classic network-flow model. The generalization involves the replacement of deterministic demand with stochastic demand. While this generalization ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback