{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:40:10Z","timestamp":1747654810442,"version":"3.40.5"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1023\/a:1021893712145","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T23:56:02Z","timestamp":1048290962000},"page":"75-90","source":"Crossref","is-referenced-by-count":3,"title":["On Using Tabu Search for Design Automation of VLSI Systems"],"prefix":"10.1007","volume":"9","author":[{"given":"John M.","family":"Emmert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandeep","family":"Lodha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dinesh K.","family":"Bhatia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5111381_CR1","doi-asserted-by":"crossref","unstructured":"Alpert, C.J., L. Hagen, and A. Kahng. (1996). \u201cA Hybrid Multilevel\/Genetic Approach for Circuit Partitioning.\u201d In Physical Design Workshop, pp. 100\u2013105.","DOI":"10.1109\/APCAS.1996.569275"},{"key":"5111381_CR2","doi-asserted-by":"crossref","unstructured":"Alpert, C.J., J. Huang, and A. Kahng. (1997). \u201cMultilevel Circuit Partitioning.\u201d In Proceedings ACM\/IEEE Design Automation Conference, pp. 530\u2013533.","DOI":"10.1145\/266021.266275"},{"key":"5111381_CR3","doi-asserted-by":"crossref","unstructured":"Alpert, C.J. and S. Yao. (1995). \u201cSpectral Partitioning: The More Eigenvectors, The Better.\u201d In Proceedings of the 32nd ACM\/IEEE Design Automation Conference, pp. 195\u2013200.","DOI":"10.1109\/DAC.1995.250089"},{"key":"5111381_CR4","unstructured":"Altera Inc. http:\/\/www.altera.com."},{"key":"5111381_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02085633","volume":"50","author":"A.A. Andreatta","year":"1996","unstructured":"Andreatta, A.A. and C.C. Ribeiro. (1996). \u201cA Graph Partitioning Heuristic for the Parallel Pseudo-Exhaustive Logical Test of VLSI Combinational Circuits.\u201d Annals of Operation Research 50, 1\u201336.","journal-title":"Annals of Operation Research"},{"key":"5111381_CR6","first-page":"213","volume-title":"Lecture Notes in Computer Science","author":"V. Betz","year":"1997","unstructured":"Betz, V. and J. Rose. (1997). \u201cVPR: A New Packing, Placement, and Routing Tool for FPGA Research.\u201d In Lecture Notes in Computer Science, vol. 1304, Berlin: Springer-Verlag, pp. 213\u2013222."},{"key":"5111381_CR7","first-page":"343","volume":"1","author":"M.A. Breuer","year":"1977","unstructured":"Breuer, M.A. (1977). \u201cMin-Cut Placement.\u201d Journal of Design Automation and Fault Tolerant Computing 1, 343\u2013362.","journal-title":"Journal of Design Automation and Fault Tolerant Computing"},{"key":"5111381_CR8","doi-asserted-by":"crossref","unstructured":"Callahan, T.J., P. Chong, A. DeHon, and J. Wawrzynek. (1998). \u201cFast Module Mapping and Placement for Datapaths in FPGAs.\u201d In ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays, pp. 123\u2013132.","DOI":"10.1145\/275107.275132"},{"key":"5111381_CR9","doi-asserted-by":"crossref","unstructured":"Dutt, S. and W. Deng. (1996). \u201cVLSI Circuit Partitioning by Cluster-Removal Using Iterative Improvement Techniques.\u201d Proceedings of the IEEE\/ACMInternational Conference on Computer Aided Design, pp. 194\u2013200.","DOI":"10.1109\/ICCAD.1996.569591"},{"key":"5111381_CR10","doi-asserted-by":"crossref","unstructured":"Emmert, J.M. and D.K. Bhatia. (1999a). \u201cA Methodology for Fast FPGA Floorplanning.\u201d In ACM Seventh International Symposium on Field-Programmable Gate Arrays, pp. 47\u201356.","DOI":"10.1145\/296399.296427"},{"key":"5111381_CR11","unstructured":"Emmert, J.M. and D.K. Bhatia. (1999b). \u201cFast Timing Driven Placement Using TABU Search.\u201d In IEEE International Symposium on Circuits and Systems."},{"key":"5111381_CR12","first-page":"81","volume-title":"Lecture Notes in Computer Science, 9th International Workshop on Field Programmable Logic (FPL99)","author":"J.M. Emmert","year":"1999","unstructured":"Emmert, J.M. and D.K. Bhatia. (1999c). \u201cTabu Search: Ultra-Fast Placement for FPGAs.\u201d In Lecture Notes in Computer Science, 9th International Workshop on Field Programmable Logic (FPL99). Berlin: Springer-Verlag, pp. 81\u201390."},{"key":"5111381_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F. and M. Laguna. (1997). Tabu Search, Dordrecht: Kluwer Academic Publishers."},{"key":"5111381_CR14","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning, Reading, MA: Addison-Wesley."},{"key":"5111381_CR15","doi-asserted-by":"crossref","unstructured":"Hagen, L.W. and A.B. Kahng. (1991). \u201cFast Spectral Methods for Ratio Cut Partitioning and Clustering.\u201d In Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design, pp. 10\u201313.","DOI":"10.1109\/ICCAD.1991.185177"},{"key":"5111381_CR16","unstructured":"Hanan, M., P.K. Wolff, and B.J. Agule. (1976). \u201cA Study of Placement Techniques.\u201d Design Automation and Fault-Tolerant Computing, pp. 28\u201361."},{"key":"5111381_CR17","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W. and S. Lin. (1970). \u201cAn Efficient Heuristic Procedure for Partitioning Graphs.\u201d Bell Sys. Tech. Journal 49, 291\u2013308.","journal-title":"Bell Sys. Tech. Journal"},{"key":"5111381_CR18","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., D.D. Gelatt, and M.P. Vecchi. (1983). \u201cOptimization by Simulated Annealing.\u201d Science 220, 671\u2013680.","journal-title":"Science"},{"key":"5111381_CR19","doi-asserted-by":"crossref","unstructured":"Krupnova, H., C. Rabedaoro, and G. Saucier. (1997). \u201cSynthesis and Floorplanning for Large Hierarchical FPGAs.\u201d In ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays, pp. 105\u2013111.","DOI":"10.1145\/258305.258320"},{"key":"5111381_CR20","unstructured":"Lim, A. (1996). \u201cPerformance Driven Placement Using Tabu Search.\u201d Informatica 7(1)."},{"key":"5111381_CR21","doi-asserted-by":"crossref","unstructured":"Lim, A., Y.M. Chee, and C.T. Wu. (1991). \u201cPerformance Driven Placement with Global Routing for Macro Cells.\u201d In Proceedings of Second Great Lakes Symposium on VLSI, pp. 35\u201341.","DOI":"10.1109\/GLSV.1992.218367"},{"key":"5111381_CR22","doi-asserted-by":"crossref","unstructured":"Lodha, S.K. and D.K. Bhatia. (1998). \u201cBipartitioning Circuits Using Tabu Search.\u201d In 11th Annual IEEE International ASIC Conference.","DOI":"10.1109\/ASIC.1998.722909"},{"key":"5111381_CR23","doi-asserted-by":"crossref","unstructured":"Mathur, A., K.C. Chen, and C.L. Liu. (1995). \u201cRe-engineering of Timing Constrained Placements for Regular Architectures.\u201d In IEEE\/ACM International Conference on Computer Aided Design, pp. 485\u2013490.","DOI":"10.1109\/ICCAD.1995.480161"},{"key":"5111381_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1361-8","volume-title":"Meta-Heuristics: Theory and Applications","author":"I.H. Osman","year":"1996","unstructured":"Osman, I.H. and J.P. Kelly. (1996). Meta-Heuristics: Theory and Applications, Dordrecht: Kluwer Academic Publishers."},{"key":"5111381_CR25","doi-asserted-by":"crossref","unstructured":"Reiss, B.M., K. Doll, and F.M. Johannes. (1994). \u201cPartitioning Very Large Circuits Using Analytical Placement Techniques.\u201d ACM\/IEEE Design Automation Conference, pp. 646\u2013651.","DOI":"10.1145\/196244.196602"},{"key":"5111381_CR26","unstructured":"Sait, S.M. and H. Youssef. (1995). VLSI Physical Design Automation, IEEE Press."},{"key":"5111381_CR27","doi-asserted-by":"crossref","unstructured":"Shi, J. and D. Bhatia. (1997). \u201cPerformance Driven Floorplanning for FPGA Based Designs.\u201d In ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays, pp. 112\u2013118.","DOI":"10.1145\/258305.258321"},{"key":"5111381_CR28","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0026-2692(92)90006-M","volume":"23","author":"L. Song","year":"1992","unstructured":"Song, L. and A. Vannelli. (1992). \u201cA VLSI Placement Method Using Tabu Search.\u201d In Microelectronics Journal 23, pp. 167\u2013172.","journal-title":"Microelectronics Journal"},{"key":"5111381_CR29","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/43.720317","volume":"17","author":"N. Togawa","year":"1998","unstructured":"Togawa, N., M. Yanagisawa, and T. Ohtsuki. (1998). \u201cMaple-Opt: A Performance-Oriented Simultaneous Technology Mapping, Placement, and Global Routing Algorithm for FPGA's.\u201d IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 17, 803\u2013823.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"5111381_CR30","unstructured":"Xilinx Inc. http:\/\/www.xilinx.com."},{"key":"5111381_CR31","doi-asserted-by":"crossref","unstructured":"Yamanouchi, T., K. Tamakashi, and T. Kambe. (1996). \u201cHybrid Floorplanning Based on Partial Clustering and Module Restructuring.\u201d In Proceedings of the IEEE International Conference on Computer-Aided Design, pp. 478\u2013483.","DOI":"10.1109\/ICCAD.1996.569866"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021893712145.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021893712145\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021893712145.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:06:21Z","timestamp":1747652781000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021893712145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["5111381"],"URL":"https:\/\/doi.org\/10.1023\/a:1021893712145","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}