Clustering methods for printed circuit board insertion problems
From MaRDI portal
Publication:3156664
DOI10.1057/palgrave.jors.2601018zbMath1107.90394OpenAlexW2008239145MaRDI QIDQ3156664
Publication date: 10 January 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601018
Programming involving graphs or networks (90C35) Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem ⋮ A new preconditioner for the interface system arising in a fast Helmholtz solver
This page was built for publication: Clustering methods for printed circuit board insertion problems
