Location of Repository

Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems

By Amy Cohn, Michael Magazine and George Polak


Clustering problems are often difficult to solve due to nonlinear cost functions and complicating constraints. Set partitioning formulations can help overcome these challenges, but at the cost of a very large number of variables. Therefore, techniques such as delayed column generation must be used to solve these large integer programs. The underlying pricing problem can suffer from the same challenges (non-linear cost, complicating constraints) as the original problem, however, making a mathematical programming approach intractable. Motivated by a real-world problem in printed circuit board (PCB) manufacturing, we develop a search-based algorithm (Rank-Cluster-and-Prune) as an alternative, present computational results for the PCB problem to demonstrate the tractability of our approach, and identify a broader class of clustering problems for which this approach can be used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 200

Publisher: Wiley Subscription Services, Inc., A Wiley Company
Year: 2009
DOI identifier: 10.1002/nav.20343
OAI identifier: oai:deepblue.lib.umich.edu:2027.42/62058
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/2027.42/... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.