{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:49:10Z","timestamp":1725490150974},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540435914"},{"type":"electronic","value":"9783540460435"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46043-8_60","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T12:57:11Z","timestamp":1188219431000},"page":"592-602","source":"Crossref","is-referenced-by-count":1,"title":["Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications"],"prefix":"10.1007","author":[{"given":"L.","family":"Lada\u0144yi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. K.","family":"Ralphs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. J.","family":"Saltzman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,4,10]]},"reference":[{"key":"60_CR1","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1137\/0804046","volume":"4","author":"J. Eckstein","year":"1994","unstructured":"Eckstein, J.: Parallel Branch and Bound Algorithms for General Mixed Integer Programming on the CM-5. SIAM Journal on Optimization 4, 794\u2013814, 1994.","journal-title":"SIAM Journal on Optimization"},{"key":"60_CR2","first-page":"15","volume":"9","author":"J. Eckstein","year":"1997","unstructured":"Eckstein, J.: How Much Communication Does Parallel Branch and Bound Need? INFORMS Journal on Computing 9, 15\u201329, 1997.","journal-title":"Journal on Computing"},{"key":"60_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., and Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco, 1979."},{"key":"60_CR4","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1287\/opre.42.6.1042","volume":"42","author":"B. Gendron","year":"1994","unstructured":"Gendron, B., and Crainic, T.G.: Parallel Branch and Bound Algorithms: Survey and Synthesis. Operations Research 42, 1042\u20131066, 1994.","journal-title":"Operations Research"},{"key":"60_CR5","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1287\/ijoc.7.4.365","volume":"7","author":"A. Grama","year":"1995","unstructured":"Grama, A., and Kumar, V.: Parallel Search Algorithms for Discrete Optimization Problems. ORSA Journal on Computing 7, 365\u2013385, 1995.","journal-title":"ORSA Journal on Computing"},{"key":"60_CR6","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., Junger, M., and Reinelt, G.: A Cutting Plane Algorithm for the Linear Ordering Problem. Operations Research 32, 1195\u20131220, 1984.","journal-title":"Operations Research"},{"key":"60_CR7","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02022040","volume":"4","author":"K. Hoffman","year":"1985","unstructured":"Hoffman, K., and Padberg, M.: LP-Based Combinatorial Problem Solving. Annals of Operations Research 4, 145\u2013194, 1985.","journal-title":"Annals of Operations Research"},{"key":"60_CR8","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/BF01389001","volume":"16","author":"V. Kumar","year":"1987","unstructured":"Kumar, V., and Rao, V.N.: Parallel Depth-first Search. Part II. Analysis. International Journal of Parallel Programming 16, 501\u2013519, 1987.","journal-title":"International Journal of Parallel Programming"},{"key":"60_CR9","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1006\/jpdc.1994.1099","volume":"22","author":"V. Kumar","year":"1994","unstructured":"Kumar, V., and Gupta, A.: Analyzing Scalability of Parallel Algorithms and Architectures. Journal of Parallel and Distributed Computing 22, 379\u2013391, 1994.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"60_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-45586-8_6","volume-title":"Computational Combinatorial Optimization","author":"L. Lad\u00e1nyi","year":"2001","unstructured":"Lad\u00e1nyi, L., Ralphs, T.K., and Trotter, L.E.: Branch, Cut, and Price: Sequential and Parallel. In Computational Combinatorial Optimization, D. Naddef and M. J\u00fcnger, eds., Springer, Berlin, 223\u2013260, 2001."},{"key":"60_CR11","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M. Padberg","year":"1991","unstructured":"Padberg, M., and Rinaldi, G.: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Traveling Salesman Problems. SIAM Review 33, 60\u2013100, 1991.","journal-title":"SIAM Review"},{"key":"60_CR12","unstructured":"Ralphs, T.K., SYMPHONY Version 2.8 User\u2019s Guide. Lehigh University Industrial and Systems Engineering Technical Report 01T-011. Available at \n                    http:\/\/www.branchandcut.org\/SYMPHONY\n                    \n                  ."},{"key":"60_CR13","unstructured":"Ralphs, T.K. and Lad\u00e1nyi, L.: COIN\/BCP User\u2019s Guide, 2001. Available at \n                    http:\/\/www.coin-or.org\n                    \n                  ."},{"key":"60_CR14","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/BF01389000","volume":"16","author":"V.N. Rao","year":"1987","unstructured":"Rao, V.N., and Kumar, V.: Parallel Depth-first Search. Part I. Implementation. International Journal of Parallel Programming 16, 479\u2013499, 1987.","journal-title":"International Journal of Parallel Programming"},{"key":"60_CR15","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0167-6377(93)90050-Q","volume":"13","author":"R. Rushmeier","year":"1993","unstructured":"Rushmeier, R., and Nemhauser, G.L.: Experiments with Parallel Branch and Bound Algorithms for the Set Covering Problem. Operations Research Letters 13, 277\u2013285, 1993.","journal-title":"Operations Research Letters"},{"key":"60_CR16","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1287\/opre.45.6.831","volume":"45","author":"M.W.P. Savelsbergh","year":"1997","unstructured":"Savelsbergh, M.W.P.: A Branch-and-Price Algorithm for the Generalized Assignment Problem. Operations Research 45, 831\u2013841, 1997.","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2014 ICCS 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46043-8_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T22:35:28Z","timestamp":1550874928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46043-8_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540435914","9783540460435"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-46043-8_60","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}