{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:15:53Z","timestamp":1720696553967},"reference-count":42,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Simulation Practice and Theory"],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1016\/0928-4869(95)00036-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:20:51Z","timestamp":1027642851000},"page":"169-188","source":"Crossref","is-referenced-by-count":5,"title":["Parallel search in discrete optimization problems"],"prefix":"10.1016","volume":"4","author":[{"given":"Alexander","family":"Reinefeld","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0928-4869(95)00036-4_bib1","series-title":"Proceedings for the 3rd Symposium on Frontiers Massively Parallel Computing","first-page":"166","article-title":"Efficient parallel algorithms for searching problems: Applications in VLSI CAD","author":"Arvindam","year":"1990"},{"key":"10.1016\/0928-4869(95)00036-4_bib2","author":"Beguelin","year":"1991"},{"key":"10.1016\/0928-4869(95)00036-4_bib3","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1287\/opre.25.1.30","article-title":"An algorithm for two-dimensional cutting problems","volume":"25","author":"Christofides","year":"1977","journal-title":"Oper. Res."},{"key":"10.1016\/0928-4869(95)00036-4_bib4","series-title":"Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","article-title":"LogP: Towards a realistic model of parallel computation","author":"Culler","year":"1993"},{"key":"10.1016\/0928-4869(95)00036-4_bib5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0190(83)90092-3","article-title":"Derivation of termination detection algorithm for distributed computation","volume":"16","author":"Dijkstra","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0928-4869(95)00036-4_bib6","unstructured":"O.I. El-Dessouki and W.H. Huen, Distributed enumeration on network computers in: Proceedings of the 1979 International Conference on Parallel Processing, 137\u2013146."},{"key":"10.1016\/0928-4869(95)00036-4_bib7","series-title":"Proceedings of the 5th Conference on Distributed Computer Systems","first-page":"446","article-title":"DIB \u2014 A distributed implementation of backtracking","author":"Finkel","year":"1985"},{"key":"10.1016\/0928-4869(95)00036-4_bib8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","article-title":"Partial constraint satisfaction","volume":"58","author":"Freuder","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0928-4869(95)00036-4_bib9","article-title":"Parallel Processing of Discrete Optimization Problems","author":"Grama","year":"1992"},{"key":"10.1016\/0928-4869(95)00036-4_bib10","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1006\/jpdc.1993.1107","article-title":"Performance properties of large scale parallel systems","volume":"19","author":"Gupta","year":"1993","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0928-4869(95)00036-4_bib11","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The traveling salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Oper. Res."},{"key":"10.1016\/0928-4869(95)00036-4_bib12","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF02186483","article-title":"Parallel computing in combinatorial optimization","volume":"14","author":"Kindervater","year":"1988","journal-title":"Ann. of Oper. Res."},{"key":"10.1016\/0928-4869(95)00036-4_bib13","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","article-title":"An analysis of alpha-beta pruning","volume":"6","author":"Knuth","year":"1975","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0928-4869(95)00036-4_bib14","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","article-title":"Depth-first iterative-deepening: An optimal admissible tree search","volume":"27","author":"Korf","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0928-4869(95)00036-4_bib15","series-title":"Parallel Algorithms for Machine Intelligence and Vision","first-page":"1","article-title":"Scalable parallel formulations of depth-first search","author":"Kumar","year":"1990"},{"key":"10.1016\/0928-4869(95)00036-4_bib16","article-title":"Introduction to Parallel Computing","author":"Kumar","year":"1994"},{"key":"10.1016\/0928-4869(95)00036-4_bib17","series-title":"Search in Artificial Intelligence","first-page":"91","article-title":"A general branch-and-bound formulation for AND\/OR graph and game-tree search","author":"Kumar","year":"1988"},{"key":"10.1016\/0928-4869(95)00036-4_bib18","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0004-3702(92)90106-8","article-title":"Effective solution of qualitative interval constraint problems","volume":"57","author":"Ladkin","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0928-4869(95)00036-4_bib19","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1287\/opre.14.4.699","article-title":"Branch and bound methods: A survey","volume":"14","author":"Lawler","year":"1966","journal-title":"Oper. Res."},{"key":"10.1016\/0928-4869(95)00036-4_bib20","series-title":"Proceedings of the International Parallel Processing Symposium","article-title":"Load balancing for distributed branch & bound algorithms","author":"L\u00fcling","year":"1992"},{"key":"10.1016\/0928-4869(95)00036-4_bib21","series-title":"Proceedings of the DIMACS Workshop \u201cParallel Processing of Discrete Optimization Problems\u201d","article-title":"Load balancing for distributed branch & bound algorithms Experiments and theory","author":"L\u00fcling","year":"1994"},{"key":"10.1016\/0928-4869(95)00036-4_bib22","series-title":"Proceedings of the 10th National Conference on Artificial Intelligence","first-page":"539","article-title":"Performance of IDA* on trees and graphs","author":"Mahanti","year":"1992"},{"key":"10.1016\/0928-4869(95)00036-4_bib23","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0377-2217(92)90212-R","article-title":"An and-or-graph approach for two dimensional cutting problems","volume":"58","author":"Morabito","year":"1992","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0928-4869(95)00036-4_bib24","series-title":"Principles of Artificial Intelligence","author":"Nilsson","year":"1980"},{"key":"10.1016\/0928-4869(95)00036-4_bib25","author":"Parsytec Computer GmbH","year":"1994","journal-title":"Parix V1.3 PowerPC Software Documentation"},{"key":"10.1016\/0928-4869(95)00036-4_bib26","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0928-4869(95)00036-4_bib27","series-title":"Intelligent Search Strategies for Computer Problem Solving","article-title":"Heuristics","author":"Pearl","year":"1984"},{"key":"10.1016\/0928-4869(95)00036-4_bib28","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1109\/34.134045","article-title":"Single-agent parallel window search","volume":"13","author":"Powley","year":"1991","journal-title":"IEEE Trans. Pattern Analysis Machine Intelligence"},{"key":"10.1016\/0928-4869(95)00036-4_bib29","series-title":"Proceedings of the 3rd ACM Symposium on Parallel Algorithms and Architecture","first-page":"40","article-title":"Optimal speedup for backtracking search on a butterfly network","author":"Ranade","year":"1991"},{"key":"10.1016\/0928-4869(95)00036-4_bib30","unstructured":"V.N. Rao, V. Kumar and K. Ramesh, A parallel implementation of iterative-deepening A* in: Proceedings of the AAAI-87, 878\u2013882."},{"key":"10.1016\/0928-4869(95)00036-4_bib31","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1109\/71.219757","article-title":"On the efficiency of parallel backtracking","volume":"4","author":"Rao","year":"1993","journal-title":"IEEE Trans. Par. Distributed Systems"},{"key":"10.1016\/0928-4869(95)00036-4_bib32","unstructured":"D. Ratner and M. Warmuth, Finding a shortest solution for the N \u00d7 N extension of the 15-puzzle is intractable in:Proceedings of the AAAI-86, 168\u2013172."},{"key":"10.1016\/0928-4869(95)00036-4_bib33","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1109\/34.297950","article-title":"Enhanced iterative-deepening search","volume":"16","author":"Reinefeld","year":"1994","journal-title":"IEEE Trans. Pattern Analysis Machine intelligence"},{"key":"10.1016\/0928-4869(95)00036-4_bib34","series-title":"Proceedings of the 10th Canadian Conference on Artificial Intelligence AI'94","first-page":"295","article-title":"AIDA* \u2014 Asynchronous Parallel IDA*","author":"Reinefeld","year":"1994"},{"key":"10.1016\/0928-4869(95)00036-4_bib35","series-title":"Proceedings of the Scalable High Performance Computing Conference SHPCC'94","first-page":"773","article-title":"Work-load balancing in highly parallel depth-first search","author":"Reinefeld","year":"1994"},{"key":"10.1016\/0928-4869(95)00036-4_bib36","series-title":"Proceedings of the First European PVM Users' Group Meeting","article-title":"Performance of PVM on a highly parallel transputer system","author":"Reinefeld","year":"1994"},{"key":"10.1016\/0928-4869(95)00036-4_bib37","series-title":"Proceedings of the International Conference on Parallel Processing EURO-PAR 95","article-title":"On efficient embeddings of grids into grids in PARIX","author":"R\u00f6mke","year":"1995"},{"key":"10.1016\/0928-4869(95)00036-4_bib38","series-title":"Proceedings of the 1990 National Conference on Artificial Intelligence","first-page":"227","article-title":"Consistent linear speedup to a first solution in parallel state-space search","author":"Saletore","year":"1990"},{"key":"10.1016\/0928-4869(95)00036-4_bib39","series-title":"HPCN-94","first-page":"253","article-title":"A comparison of the IServer-OCCAM, Paris, Express and PVM programming environments on a Parsytec GCel","volume":"797","author":"Sloot","year":"1994"},{"key":"10.1016\/0928-4869(95)00036-4_bib40","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0004-3702(79)90016-X","article-title":"A minimax algorithm faster than alpha-beta?","volume":"12","author":"Stockman","year":"1979","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0928-4869(95)00036-4_bib41","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0019-9958(83)80038-2","article-title":"Optimal orientations of cells in silicon floorplan designs","volume":"57","author":"Stockmeyer","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/0928-4869(95)00036-4_bib42","series-title":"Proceedings of the 25th ACM\/IEEE Design Automation Conference","first-page":"66","article-title":"Optimal aspect ratios of building blocks in VLSI","author":"Wimer","year":"1988"}],"container-title":["Simulation Practice and Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0928486995000364?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0928486995000364?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T02:21:55Z","timestamp":1555467715000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0928486995000364"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":42,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0928486995000364"],"URL":"https:\/\/doi.org\/10.1016\/0928-4869(95)00036-4","relation":{},"ISSN":["0928-4869"],"issn-type":[{"value":"0928-4869","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}