Dimensioning multicast-enabled communications networks
Networks 39 (2002), 216-231. CitationNetworks 39 (2002), 216-231.
0-1 Programming
A Family of Inequalities for the Generalized Assignment Polytope
We present a family of inequalities that are valid for the generalized assignment polytope. Although the inequalities are not facet-defining in general, they define facets of a polytope of a relaxation. We report computational results on the use of the inequalities in a branch-and-cut scheme that demonstrate their effectiveness. CitationDepartment of Industrial Engineering, State University … Read more
A Parallel, Linear Programming Based Heuristic for Large Scale Set Partitioning Problems
We describe a parallel, linear programming and implication based heuristic for solving set partitioning problems on distributed memory computer architectures. Our implementation is carefully designed to exploit parallelism to greatest advantage in advanced techniques like preprocessing and probing, primal heuristics, and cut generation. A primal-dual subproblem simplex method is used for solving the linear programming … Read more