{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:05:15Z","timestamp":1747652715510},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648093"},{"type":"electronic","value":"9783540685333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0018549","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T08:30:21Z","timestamp":1131870621000},"page":"310-331","source":"Crossref","is-referenced-by-count":17,"title":["Cooperative multi-thread parallel tabu search with an application to circuit partitioning"],"prefix":"10.1007","author":[{"given":"Renata M.","family":"Aiex","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simone de L.","family":"Martins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Celso C.","family":"Ribeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noemi de la R.","family":"Rodriguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"28_CR1","unstructured":"R.M. Aiex, Asynchronous Parallel Tabu Search Strategies with an Application to Graph Partitioning (in Portuguese), M.Sc. Dissertation, Department of Computer Science, Catholic University of Rio de Janeiro, 1996."},{"key":"28_CR2","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 50 (1994), 1\u201336.","journal-title":"Annals of Operations Research"},{"key":"28_CR3","unstructured":"E.C. Archambeau and E.J. Mccluskey, \u201cFault Coverage of Pseudo-Exhaustive Testing\u201d, Digest of Papers of the 14th International Conference on Fault-Tolerant Computing, 141\u2013145, IEEE, 1984."},{"key":"28_CR4","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0968-090X(97)00005-3","volume":"5","author":"P. Badeau","year":"1997","unstructured":"P. Badeau, F. Guertin, J.-Y. Potvin, M.Gendreau, and E.D. Taillard, \u201cA Parallel Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows\u201d, Transportation Research C 5 (1997), 109\u2013122.","journal-title":"Transportation Research C"},{"key":"28_CR5","unstructured":"F. Berglez and H. Fujiwara, \u201cA Neutral Netlist of 10 Combinational Benchmark Circuits and a Target Translator in Fortran\u201d, Special session on \u201cATPG and Fault Simulation\u201d, IEEE International Symposium on Circuits and Systems, Kyoto, 1985."},{"key":"28_CR6","series-title":"Proceedings of the Fourth MIR Conference: Advanced Research in VLSI","first-page":"91","volume-title":"Partitioning Circuits for Improved Testability","author":"S.N. Bhatt","year":"1986","unstructured":"S.N. Bhatt, F.R.K. Chung, and A.L. Rosenberg, \u201cPartitioning Circuits for Improved Testability\u201d, Proceedings of the Fourth MIR Conference: Advanced Research in VLSI, 91\u2013106, The MIT Press, Cambridge, 1986."},{"key":"28_CR7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/2080.357392","volume":"2","author":"A. Birrell","year":"1984","unstructured":"A. Birrell and B. Nelson, \u201cImplementing remote procedure calls\u201d, ACM Transactions on Computer Systems 2 (1984), 39\u201359.","journal-title":"ACM Transactions on Computer Systems"},{"key":"28_CR8","unstructured":"S. Bozorgui-Nesbat and E.J. McCluskey, \u201cStructured Design for Testability to Eliminate Test Pattern Generation\u201d, Digest of Papers of the 10th International Symposium on Fault-Tolerant Computing, 158\u2013163, IEEE, 1980."},{"key":"28_CR9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/72551.72553","volume":"21","author":"N. Carriero","year":"1989","unstructured":"N. Carriero and D. Gelernter, \u201cHow to Write Parallel Programs: A Guide to the Perplexed\u201d, ACM Computing Surveys 21 (1989), 323\u2013357.","journal-title":"ACM Computing Surveys"},{"key":"28_CR10","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1145\/63334.63337","volume":"32","author":"N. Carriero","year":"1989","unstructured":"N. Carriero, D. Gelernter; and T. Mattson, \u201cLinda in Context\u201d, Communications of the ACM 32 (1989), 444\u2013458.","journal-title":"Communications of the ACM"},{"key":"28_CR11","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/cpe.4330070106","volume":"7","author":"P. Cignoni","year":"1995","unstructured":"P. Cignoni, D. Laforenza, R. Perego, R. Scopigno, and C. Montani, \u201cEvaluation of Paxallelization Strategies for an Incremental Delaunay Triangulator in E3\u201d, Concurrency: Practice and Experience 7 (1995), 61\u201380.","journal-title":"Concurrency: Practice and Experience"},{"key":"28_CR12","unstructured":"T.G. Crainic and M. Gendreau, \u201cA Cooperative Parallel Tabu Search for Capacited Network Design\u201d, Research report, Centre de Recherche sur les Transports, Universit\u00e9 de Montr\u00e9al, 1997."},{"key":"28_CR13","unstructured":"T.G. Crainic and M. Toulouse, \u201cParallel Metaheuristics\u201d, Research report, Centre de Recherche sur les Transports, Universit\u00e9 Universit\u00e9 Montr\u00e9al, 1997."},{"key":"28_CR14","unstructured":"T.G. Crainic, M. Toulouse., and M. Gendreau, \u201cParallel Asynchronous Tabu Search for Multicommodity Location-Allocation with Balancing Requirements\u201d, Publication 935, Centre de Recherche sur les Transports, Universit\u00e9 de Montr\u00e9al, 1993."},{"key":"28_CR15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/ijoc.9.1.61","volume":"9","author":"T.G. Crainic","year":"1997","unstructured":"T.G. Crainic, M. Toulouse, and M. Gendreau, \u201cTowards a Taxonomy of Parallel Tabu Search\u201d, INFORMS Journal on Computing 9 (1997), 61\u201372.","journal-title":"INFORMS Journal on Computing"},{"key":"28_CR16","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01719254","volume":"17","author":"T.G. Crainic","year":"1995","unstructured":"T.G. Crainic, M. Toulouse, and M. Gendreau, \u201cSynchronous Tabu Search Parallelization Strategies for Multicommodity Location-Allocation with Balancing Requirements\u201d, OR Spektrum 17 (1995), 113\u2013123.","journal-title":"OR Spektrum"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"M. Toulouse, T.G. Crainic, and M. Gendreau, \u201cCommunication Issues in Designing Cooperative Multi-Thread Parallel Searches\u201d, in Meta-Heuristics: Theory and Applications (I.H. Osman and J.P. Kelly, editors), 501\u2013522, Kluwer, 1996.","DOI":"10.1007\/978-1-4613-1361-8_30"},{"key":"28_CR18","unstructured":"M. Davis-Moradkhan, Probl\u00e9mes de Partitionnement dans la Technologie des VLSI, Doctorate thesis, Universit\u00e9 Paris VI, 1993."},{"key":"28_CR19","unstructured":"M. Davis-Moradkhan and C. Roucairol, \u201cComparison of Two Heuristics for Partitioning Combinational Circuits for Parallel Pseudo-Exhaustive Testing\u201d, Rapport MASI 92.25, Laboratoire MASI, Universit\u00e9 Paris VI, 1992."},{"key":"28_CR20","unstructured":"M. Davis-Moradkhan and C. Roucairol, \u201cGraph Partitioning Applied to the Problem of Logic Testing of VLSI Combinational Circuits\u201d, Rapport MASI 92.41, Laboratoire MASI, Universit\u00e9 Paris VI, 1992."},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"I. De Falco, R. Del Balio, E. Tarantino, and R. Vacaro, \u201cImproving Search by Incorporating Evolution Principles in Parallel Tabu Search\u201d, Proceedings of the International Conference on Machine Learning, 823\u2013828, 1994.","DOI":"10.1109\/ICEC.1994.349949"},{"key":"28_CR22","unstructured":"I. De Falco, R. Del Balio, and E. Tarantino, \u201cSolving the Mapping Problem by Parallel Tabu Search\u201d, Research report, Instituto per la Recerca sui Sistemi Informatici Paralleli \u2014 CRN, 1995."},{"key":"28_CR23","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1016\/0167-8191(96)00026-9","volume":"22","author":"M. Franklin","year":"1996","unstructured":"M. Franklin and V. Govindan, \u201cA General Matrix Iterative Model for Dynamic Load Balancing\u201d, Parallel Computing 22 (1996), 969\u2013989.","journal-title":"Parallel Computing"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sun-derman, PVM: Parallel Virtual Machine \u2014 A User's Guide and Tutorial for Networked Parallel Computing, The MIT Press, 1994.","DOI":"10.7551\/mitpress\/5712.001.0001"},{"key":"28_CR25","unstructured":"M.Gendreau, P. Badeau, F. Guertin, J.-Y. Potvin, and E.D. Taillard, \u201cA Solution Procedure for Real-Time Routing and Dispatching of Commercial Vehicles\u201d, Publication CRT-96-24, Centre de Recherche sur les Transports, Universit\u00e9 de Montr\u00e9al, 1996."},{"key":"28_CR26","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"F. Glover, \u201cTabu Search \u2014 Part I\u201d, ORSA Journal on Computing 1 (1989), 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"key":"28_CR27","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"F. Glover, \u201cTabu Search \u2014 Part II\u201d, ORSA Journal on Computing 2 (1990), 4\u201332.","journal-title":"ORSA Journal on Computing"},{"key":"28_CR28","unstructured":"F. Glover and M. Laguna, \u201cTabu Search\u201d, in Modern Heuristic Techniques for Combinatorial Problems (C.R. Reeves, editor), 70\u2013150, Blackwell, 1993, Londres."},{"key":"28_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"F. Glover and M. Laguna, Tabu Search, Kluwer, 1997, Boston."},{"key":"28_CR30","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1142\/S0129053394000044","volume":"6","author":"A.H. Karp","year":"1994","unstructured":"A.H. Karp, \u201cSome Experiences with Network Linda\u201d, International Journal of High Speed Computing 6 (1994), 55\u201380.","journal-title":"International Journal of High Speed Computing"},{"key":"28_CR31","first-page":"67","volume":"5","author":"S.L. Martins","year":"1996","unstructured":"S.L. Martins; C.C. Ribeiro, and N.R. Rodriguez, \u201cParallel Programming Tools for Distributed Memory Environments\u201d (in Portuguese), Investigaci\u00f3n Operativa 5 (1996), 67\u201398.","journal-title":"Investigaci\u00f3n Operativa"},{"key":"28_CR32","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1016\/0167-8191(93)90077-X","volume":"19","author":"A. Matrone","year":"1993","unstructured":"A. Matrone, P. Schiano, and V. Puotti, \"\u201cINDA and PVM: A Comparison between Two Environments for Parallel Programming\u201d, Parallel Computing 19 (1993),949\u2013957.","journal-title":"Parallel Computing"},{"key":"28_CR33","first-page":"213","volume":"1","author":"Y. Min","year":"1986","unstructured":"Y. Min and Z. Li, \u201cPseudo-Exhaustive Testing Strategy for Large Combinational Circuits\u201d, Computer Systems Science and Engineering 1 (1986), 213\u2013220.","journal-title":"Computer Systems Science and Engineering"},{"key":"28_CR34","unstructured":"O. Patashnik, Optimal Circuit Segmentation for Pseudo-Exhaustive Testing, Doctorate thesis, Stanford University, Department of Computer Science, 1990."},{"key":"28_CR35","unstructured":"A. Petrie and R. Kerr, \u201cA Qualitative Comparison of Network Linda and PVM\u201d, Parallel Processing Memorandum PPM\/017, Department of Computing Science, University of Newcastle upon Tyne, 1994."},{"key":"28_CR36","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF00127078","volume":"1","author":"S.C. Porto","year":"1995","unstructured":"S.C. Porto and C.C. Ribeiro, \u201cParallel Tabu Search Message-Passing Synchronous Strategies for Task Scheduling under Precedence Constraints\u201d, Journal of Heuristics 1 (1995), 207\u2013223.","journal-title":"Journal of Heuristics"},{"key":"28_CR37","first-page":"113","volume":"131","author":"M.W. Roberts","year":"1984","unstructured":"M.W. Roberts and P.K. Lala, \u201cAn Algorithm for the Partitioning of Logic Circuits\u201d, IEE Proceedings-G 131 (1984), 113\u2013118.","journal-title":"IEE Proceedings-G"},{"key":"28_CR38","unstructured":"Scientific Computing Associates, Linda's User's Guide and Reference Manual, version 4.0.1 \u2014 SP2\/POE."},{"key":"28_CR39","unstructured":"F. Sukup, \u201cEfficiency Evaluation of Some Parallelization Tools on a Workstation Cluster Using the NAS Parallel Benchmarks\u201d, Research report, Vienna University of Technology, Computing Center, 1994."},{"key":"28_CR40","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/cpe.4330020404","volume":"2","author":"V. Sunderman","year":"1990","unstructured":"V. Sunderman, \u201cPVM: A Framework for Parallel Distributed Computing\u201d, Concurrency: Practice and Experience 2 (1990), 315\u2013339.","journal-title":"Concurrency: Practice and Experience"},{"key":"28_CR41","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E.D. Taillard","year":"1997","unstructured":"E.D. Taillard, P. Badeau, M.Gendreau, F. Guertin, and J.-Y. Potvin, \u201cA Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows\u201d, Transportation Science 31 (1997), 170\u2013186.","journal-title":"Transportation Science"}],"container-title":["Lecture Notes in Computer Science","Solving Irregularly Structured Problems in Parallel"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0018549","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,5]],"date-time":"2019-04-05T04:10:36Z","timestamp":1554437436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0018549"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648093","9783540685333"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/bfb0018549","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}