Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems
dc.contributor.author | Cohn, Amy | en_US |
dc.contributor.author | Magazine, Michael | en_US |
dc.contributor.author | Polak, George | en_US |
dc.date.accessioned | 2009-04-09T14:42:56Z | |
dc.date.available | 2010-06-02T14:34:29Z | en_US |
dc.date.issued | 2009-04 | en_US |
dc.identifier.citation | Cohn, Amy; Magazine, Michael; Polak, George (2009). "Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems." Naval Research Logistics 56(3): 215-225. <http://hdl.handle.net/2027.42/62058> | en_US |
dc.identifier.issn | 0894-069X | en_US |
dc.identifier.issn | 1520-6750 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/62058 | |
dc.description.abstract | 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 2009 | en_US |
dc.format.extent | 157786 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.publisher | Wiley Subscription Services, Inc., A Wiley Company | en_US |
dc.subject.other | Mathematics and Statistics | en_US |
dc.title | Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Industrial and Operations Engineering | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Industrial and Operations Engineering, College of Engineering, University of Michigan, Ann Arbor, Michigan 48109-2117 ; Department of Industrial and Operations Engineering, College of Engineering, University of Michigan, Ann Arbor, Michigan 48109-2117 | en_US |
dc.contributor.affiliationother | Quantitative Analysis and Operations Management, College of Business, University of Cincinnati, Cincinnati, Ohio 45221 | en_US |
dc.contributor.affiliationother | Department of Information Systems and Operations Management, Raj Soin College of Business, Wright State University, Dayton, Ohio 45435 | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/62058/1/20343_ftp.pdf | |
dc.identifier.doi | 10.1002/nav.20343 | en_US |
dc.identifier.source | Naval Research Logistics | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.