{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T09:59:10Z","timestamp":1769939950342,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"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":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1023\/a:1020551011615","type":"journal-article","created":{"date-parts":[[2003,3,18]],"date-time":"2003-03-18T15:12:43Z","timestamp":1048000363000},"page":"321-340","source":"Crossref","is-referenced-by-count":23,"title":["A Mixed Heuristic for Circuit Partitioning"],"prefix":"10.1007","volume":"23","author":[{"given":"C.","family":"Gil","sequence":"first","affiliation":[]},{"given":"J.","family":"Ortega","sequence":"additional","affiliation":[]},{"given":"M.G.","family":"Montoya","sequence":"additional","affiliation":[]},{"given":"R.","family":"Ba\u00f1os","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5100164_CR1","volume-title":"Simulated Annealing and Boltzmann Machines. A Stochastic Approach to Combinatorial Optimization and Neural Computing","author":"E. Aarts","year":"1990","unstructured":"E. Aarts and J.Korst, Simulated Annealing and Boltzmann Machines. A Stochastic Approach to Combinatorial Optimization and Neural Computing, John Wiley & Sons: New York, 1990."},{"issue":"1\/2","key":"5100164_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","volume":"19","author":"C.J. Alpert","year":"1995","unstructured":"C.J. Alpert and A. Kahng, \u201cRecent developments in netlist partitioning: A survey,\u201d Integration: The VLSI Journal, vol. 19, no. 1\/2, pp. 1\u201381, 1995.","journal-title":"Integration: The VLSI Journal"},{"key":"5100164_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02085633","volume":"50","author":"A.A. Andreatta","year":"1994","unstructured":"A.A. Andreatta and C.C. Ribeiro, \u201cA graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits,\u201d Annals of Operations Research, vol. 50, pp. 1\u201336, 1994.","journal-title":"Annals of Operations Research"},{"key":"5100164_CR4","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1090\/dimacs\/016\/03","volume":"16","author":"S. Areibi","year":"1993","unstructured":"S. Areibi and A. Vannelli, \u201cAdvanced search technique for circuit partitioning,\u201d in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, pp. 77\u201398, 1993.","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"5100164_CR5","volume-title":"Parallel Algorithms for VLSI Computer Aided Design","author":"P. Banerjee","year":"1994","unstructured":"P. Banerjee, Parallel Algorithms for VLSI Computer Aided Design, Prentice Hall; Englewoods Cliffs, NJ, 1994."},{"key":"5100164_CR6","unstructured":"F. Brglez and H. Fujiwara, \u201cNeural netlist of ten combinational benchmark circuits and a target translator in FORTRAN,\u201d in Proc. IEEE Int. Symp. Circuits Syst., Special Session ATPG, 1985."},{"key":"5100164_CR7","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1006\/jpdc.1998.1523","volume":"57","author":"J.A. Chandy","year":"1999","unstructured":"J.A. Chandy and P. Banerjee, \u201cA parallel circuit-partitioned algorithm for timing-driven standard cell placement,\u201d Journal of Parallel and Distributed Computing, vol. 57, pp. 64\u201390, 1999.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"5100164_CR8","doi-asserted-by":"crossref","unstructured":"J. Cong and M. Smith, \u201cA parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design,\u201d in Proc. ACM\/IEEE Design Automation Conference, 1993, pp. 755\u2013760.","DOI":"10.1145\/157485.165119"},{"key":"5100164_CR9","first-page":"20","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"K.A. Dowsland","year":"1993","unstructured":"K.A. Dowsland, \u201cSimulated annealing,\u201d in Modern Heuristic Techniques for Combinatorial Problems, C.R. Reeves (Ed.), Blackwell: London, 1993, pp. 20\u201369."},{"key":"5100164_CR10","doi-asserted-by":"crossref","unstructured":"C. Fiduccia and R. Mattheyses, \u201cA linear time heuristic for improving network partitions,\u201d in Proc. 19th IEEE Design Automation Conference, pp. 175\u2013181, 1982.","DOI":"10.1109\/DAC.1982.1585498"},{"key":"5100164_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman: San Francisco, 1979."},{"key":"5100164_CR12","unstructured":"C. Gil and J. Ortega, \u201cA parallel test pattern generator based on Reed-Muller spectrum,\u201d in EuromicroWorkshop on Parallel and Distributed Processing, IEEE, pp. 199\u2013204, 1997."},{"issue":"4","key":"5100164_CR13","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1049\/ip-cdt:19982024","volume":"145","author":"C. Gil","year":"1998","unstructured":"C. Gil and J. Ortega, \u201cAlgebraic test-pattern generation based on the Reed-Muller spectrum,\u201d IEE Proceding Computers and Digital Techniques, vol. 145, no. 4, pp. 308\u2013316, 1998.","journal-title":"IEE Proceding Computers and Digital Techniques"},{"issue":"5","key":"5100164_CR14","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1002\/1096-9128(20000425)12:5<311::AID-CPE492>3.0.CO;2-Q","volume":"12","author":"C. Gil","year":"2000","unstructured":"C. Gil, J. Ortega, and M.G. Montoya, \u201cParallel VLSI test in a shared memory multiprocessors,\u201d Concurrency: Practice and Experience, vol. 12, no. 5, pp. 311\u2013326, 2000.","journal-title":"Concurrency: Practice and Experience"},{"key":"5100164_CR15","unstructured":"J. Gilbert, G. Miller, and S. Teng, \u201cGeometric mesh partitioning: Implementation and experiments,\u201d in Proceedings of International Parallel Processing Symposium, 1995."},{"key":"5100164_CR16","first-page":"70","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"F. Glover","year":"1993","unstructured":"F. Glover and M. Laguna, \u201cTabu Search,\u201d in Modern Heuristic Techniques for Combinatorial Problems, C.R. Reeves (Ed.), Blackwell: London, 1993, pp. 70\u2013150."},{"key":"5100164_CR17","unstructured":"T. Goehring and Y. Saad, \u201cHeuristic algorithms for automatic graph partitioning,\u201d Technical Report UMSI-94-29. University of Minnesota Supercomputing Institute, 1994."},{"issue":"7","key":"5100164_CR18","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1109\/43.144852","volume":"11","author":"S.W. Hadley","year":"1992","unstructured":"S.W. Hadley, B.L. Mark, and A. Vanelli, \u201cAn efficient eigenvector approach for finding netlist partitions,\u201d IEEE Trans. on Computer-Aided Dessign, vol. 11, no. 7, pp. 885\u2013892, 1992.","journal-title":"IEEE Trans. on Computer-Aided Dessign"},{"key":"5100164_CR19","doi-asserted-by":"crossref","unstructured":"B. Hendrickson and R. Leland, \u201cA multilevel algorithm for partitioning graphs,\u201d in Proceedings Supercomputing '95, ACM Press, 1995.","DOI":"10.1145\/224170.224228"},{"key":"5100164_CR20","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D.S. Johnson","year":"1989","unstructured":"D.S. Johnson, C.R. Aragon, and L.A. McGeogh, \u201cOptimization by simulated annealing: An experimental evaluation, Part I: Graph partitioning,\u201d Operations Research, vol. 37, pp. 865\u2013892, 1989.","journal-title":"Operations Research"},{"issue":"1","key":"5100164_CR21","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G. Karypis","year":"1998","unstructured":"G. Karypis and V. Kumar, \u201cMultilevel K-way partitioning scheme for irregular graphs,\u201d Journal of Parallel and Distributed Computing, vol. 48, no. 1, pp. 96\u2013129, 1998.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"5100164_CR22","doi-asserted-by":"crossref","unstructured":"B.W. Kernighan and S. Lin, \u201cAn efficient heuristic procedure for partitioning graphics,\u201d The Bell Sys. Tech. Journal, pp. 291\u2013307, 1970.","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"5100164_CR23","doi-asserted-by":"crossref","unstructured":"R.H. Klenke, R.D. Williams, and J.H. Aylor, \u201cParallel-processing techniques for automatic test pattern generation,\u201d IEEE Computer, pp. 71\u201384, 1992.","DOI":"10.1109\/2.108056"},{"key":"5100164_CR24","unstructured":"V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing. Design and Analysis of Algorithms, The Benjamin\/Cummings Publishing, 1994."},{"key":"5100164_CR25","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1006\/jpdc.1994.1070","volume":"22","author":"V. Kumar","year":"1994","unstructured":"V. Kumar, A. Grama, and V.N. Rao, \u201cScalable load balancing techniques for parallel computers,\u201d Journal of Distributed and Parallel Computing, vol. 22, pp. 60\u201379, 1994.","journal-title":"Journal of Distributed and Parallel Computing"},{"key":"5100164_CR26","first-page":"151","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"C.R. Reeves","year":"1993","unstructured":"C.R. Reeves, \u201cGenetic algorithms,\u201d in Modern Heuristic Techniques for Combinatorial Problems, C.R. Reeves (Ed.), Blackwell: London, 1993, pp. 151\u2013196."},{"issue":"12","key":"5100164_CR27","doi-asserted-by":"crossref","first-page":"1500","DOI":"10.1109\/12.260640","volume":"42","author":"L.A. Sanchis","year":"1993","unstructured":"L.A. Sanchis, \u201cMultiple-way network partitioning with different cost functions,\u201d IEEE Trans. on Comp., vol. 42, no. 12, pp. 1500\u20131504, 1993.","journal-title":"IEEE Trans. on Comp."},{"key":"5100164_CR28","volume-title":"CRPC Parallel Computing Handbook","author":"K. Schloegel","year":"2000","unstructured":"K. Schloegel, G. Karypis, and V. Kumar, \u201cGraph partitioning for high performance scientific simulations,\u201d in CRPC Parallel Computing Handbook, Morgan Kaufmann: San Matio, CA, 2000."},{"key":"5100164_CR29","unstructured":"I. Shperling and E.J. McCluskey, \u201cCircuit segmentation for pseudo-exhhaustive testing via simulated annealing,\u201d in International Test Conference IEEE, 1987."},{"key":"5100164_CR30","unstructured":"A.J. Soper, C. Walshaw, and M. Cross, \u201cA combined evolutionary search and multilevel optimisation approach to graph partitioning,\u201d Mathematics Research Report 00\/IM\/58, University of Greenwich, 2000."},{"issue":"1","key":"5100164_CR31","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1137\/S1064827598337373","volume":"22","author":"C. Walshaw","year":"2000","unstructured":"C. Walshaw and M. Cross, \u201cMesh partitioning: A multilevel balancing and refinement algorithm,\u201d SIAM J. Sci. Comput., vol. 22, no. 1, pp. 63\u201380, 2000.","journal-title":"SIAM J. Sci. Comput."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020551011615.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020551011615\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020551011615.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:33:35Z","timestamp":1752377615000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020551011615"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["5100164"],"URL":"https:\/\/doi.org\/10.1023\/a:1020551011615","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}