A parallel, linear programming-based heuristic for large-scale set partitioning problems

A parallel, linear programming-based heuristic for large-scale set partitioning problems

0.00 Avg rating0 Votes
Article ID: iaor20021931
Country: United States
Volume: 13
Issue: 3
Start Page Number: 191
End Page Number: 209
Publication Date: Jun 2001
Journal: INFORMS Journal On Computing
Authors: , ,
Keywords: programming: linear, sets
Abstract:

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 relaxation, which breaks the linear programming solution process into natural phases from which we can exploit information to find good solutions on the various processors. Implications from the probing operation are shared among the processors. Combining these techniques allows us to obtain solutions to large and difficult problems in a reasonable amount of computing time.

Reviews

Required fields are marked *. Your email address will not be published.