Clustering methods for printed circuit board insertion problems

DOI10.1057/PALGRAVE.JORS.2601018MaRDI QIDQ3156664zbMATH OpenOpenAlexFDO

Authors Michael Ng

Publication date 10 January 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601018

zbMATH Keywords

clusteringheuristicsoptimisationproductionsequencingtravelling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Continuous location (90B85)

Recommendations

• Heuristics approach to printed circuit board insertion problem
• Integer programming approach to the printed circuit board grouping problem
• scientific article; zbMATH DE number 1114013
• An algebraic multigrid-based algorithm for circuit clustering
• 10.1007/s11470-008-1013-7
• Adaptive cluster growth: A new algorithm for circuit placement in rectilinear regions
• Approximation schemes for clustering problems

Cited in

(3)

• A new preconditioner for the interface system arising in a fast Helmholtz solver
• Algorithms for the \(q\)-model clustering problem with application in switching cabinet manufacturing
• The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem

This page was built for publication: Clustering methods for printed circuit board insertion problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3156664)