On the best search strategy in parallel branch‐and‐bound:Best‐First Search versus Lazy Depth‐First Search
The Best-First Search strategy (BeFS) and the Depth-First Search strategy (DFS) are regarded as the prime strategies when solving combinatorial optimization problems by parallel Branch-and-Bound (B ) - BeFS because of efficiency with respect to the number of nodes explored, and DFS for reasons of sp...
Saved in:
| Published in: | Annals of operations research Vol. 90; pp. 1 - 17 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Springer Nature B.V
01.01.1999
|
| Subjects: | |
| ISSN: | 0254-5330, 1572-9338 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | The Best-First Search strategy (BeFS) and the Depth-First Search strategy (DFS) are regarded as the prime strategies when solving combinatorial optimization problems by parallel Branch-and-Bound (B ) - BeFS because of efficiency with respect to the number of nodes explored, and DFS for reasons of space efficiency. We investigate the efficiency of both strategies experimentally, and two versions of each strategy are tested: In the first, a B iteration for a node consists of bounding followed by branching on the node if necessary. For the second, the order is reversed - first branching takes place, and then each child of the node is bounded and possibly fathomed. The first is called lazy, the second eager. The strategies are tested on the Quadratic Assignment Problem and the Job Shop Scheduling Problem. We use parallel codes developed specifically for the solution of the problem in question, and hence containing different heuristic rules and tests to speed up computation. In both cases, we start with an initial solution close to but not equal to the optimal solution. Surprisingly, the BeFS-based strategies turn out to be inferior to the DFS-based strategies, both in terms of running times and in terms of bound calculations performed. Furthermore, when tested in a sequential setting, DFS turns out to be still superior because pruning and evaluation tests are more effective in DFS due to the presence of better incumbents. [PUBLICATION ABSTRACT] |
|---|---|
| AbstractList | The Best-First Search strategy (BeFS) and the Depth-First Search strategy (DFS) are regarded as the prime strategies when solving combinatorial optimization problems by parallel Branch-and-Bound (B ) - BeFS because of efficiency with respect to the number of nodes explored, and DFS for reasons of space efficiency. We investigate the efficiency of both strategies experimentally, and two versions of each strategy are tested: In the first, a B iteration for a node consists of bounding followed by branching on the node if necessary. For the second, the order is reversed - first branching takes place, and then each child of the node is bounded and possibly fathomed. The first is called lazy, the second eager. The strategies are tested on the Quadratic Assignment Problem and the Job Shop Scheduling Problem. We use parallel codes developed specifically for the solution of the problem in question, and hence containing different heuristic rules and tests to speed up computation. In both cases, we start with an initial solution close to but not equal to the optimal solution. Surprisingly, the BeFS-based strategies turn out to be inferior to the DFS-based strategies, both in terms of running times and in terms of bound calculations performed. Furthermore, when tested in a sequential setting, DFS turns out to be still superior because pruning and evaluation tests are more effective in DFS due to the presence of better incumbents. [PUBLICATION ABSTRACT] |
| Author | Perregaard, M. Clausen, J. |
| Author_xml | – sequence: 1 givenname: J. surname: Clausen fullname: Clausen, J. – sequence: 2 givenname: M. surname: Perregaard fullname: Perregaard, M. |
| BookMark | eNp1kL9OwzAQxi0EEm1hZrXYQ_0nTpxupVBAqtQBmCPHuZBUwUltB6lMPALPyJNgVBYqsdzppO939903RsemM4DQBSVXlDA-nc8ooTITLGYZz5IjNKIiZVHGuTxGI8JEHAnOySkaO7chhFAqxQht1wb7GnABzmMHyuoaO2-Vh5cdbgzulVVtCy0urDK6_vr4VKYMtegGU86uAxWGZWMD_bin38C6weGVet_hG-h9fSA4QyeVah2c__YJel7ePi3uo9X67mExX0Wac-YjnaiC0YpkhU5LyWMioSIpScpYaCXTLAvPMFFVwGMlE8qBUUhozHSqpRIAfIIu93t7222HYDTfdIM14WTOaCwoISwNoulepG3nnIUq723zquwupyT_iTWf539iDYQ4IHTjlW86E1Jr2n-5b8xegQU |
| CitedBy_id | crossref_primary_10_1007_s10100_018_0576_1 crossref_primary_10_1016_j_ejor_2016_10_003 crossref_primary_10_1016_S0167_8191_99_00094_0 crossref_primary_10_4018_IJAMC_292517 crossref_primary_10_1287_trsc_2019_0896 crossref_primary_10_1007_s10479_021_04515_0 crossref_primary_10_1016_j_jcss_2013_08_003 crossref_primary_10_1111_mice_12233 crossref_primary_10_1023_A_1016246616462 crossref_primary_10_1016_j_ecolind_2020_106513 crossref_primary_10_1109_JSAC_2003_816622 crossref_primary_10_1007_s11081_010_9107_1 crossref_primary_10_1007_s12532_015_0087_1 crossref_primary_10_1016_j_cor_2018_12_020 crossref_primary_10_1016_j_trb_2017_10_005 crossref_primary_10_1007_s10107_024_02145_5 crossref_primary_10_1214_21_AOS2155 |
| Cites_doi | 10.1016/0166-218X(94)90014-0 10.1023/A:1008696503659 10.1287/mnsc.34.3.391 10.1007/BFb0027123 10.1287/ijoc.7.4.365 10.1016/0020-0190(86)90109-2 10.1023/A:1018903912673 10.1287/opre.42.6.1042 10.1145/358080.358103 10.1007/3-540-60321-2_29 10.1007/978-1-4613-3400-2_7 10.1007/BF03543071 10.1287/mnsc.35.2.164 10.1109/TC.1985.6312201 10.1109/TC.1986.5009434 10.1287/opre.16.1.150 |
| ContentType | Journal Article |
| Copyright | Copyright Kluwer Academic Publishers 1999 |
| Copyright_xml | – notice: Copyright Kluwer Academic Publishers 1999 |
| DBID | AAYXX CITATION 3V. 7TA 7TB 7WY 7WZ 7XB 87Z 88I 8AL 8AO 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FR3 FRNLG F~G GNUQQ HCIFZ JG9 JQ2 K60 K6~ K7- KR7 L.- L6V M0C M0N M2P M7S P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U |
| DOI | 10.1023/A:1018952429396 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Materials Business File Mechanical & Transportation Engineering Abstracts ProQuest ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Science Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni Edition) ProQuest Materials Science & Engineering ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials Local Electronic Collection Information ProQuest Central Business Premium Collection Technology collection ProQuest One Community College ProQuest Central Engineering Research Database Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Premium Collection Materials Research Database ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database Civil Engineering Abstracts ABI/INFORM Professional Advanced ProQuest Engineering Collection ABI/INFORM Global (OCUL) Computing Database Science Database Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business (UW System Shared) ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering collection ProQuest Central Basic |
| DatabaseTitle | CrossRef Materials Research Database ProQuest Business Collection (Alumni Edition) Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ProQuest Central China ABI/INFORM Complete Materials Business File ProQuest One Applied & Life Sciences ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition Engineering Research Database ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Central Korea ABI/INFORM Complete (Alumni Edition) Civil Engineering Abstracts ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | Materials Research Database |
| Database_xml | – sequence: 1 dbid: BENPR name: AUTh Library subscriptions: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1572-9338 |
| EndPage | 17 |
| ExternalDocumentID | 405817751 10_1023_A_1018952429396 |
| Genre | Feature |
| GroupedDBID | -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 2.D 203 23M 28- 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 7WY 88I 8AO 8FE 8FG 8FL 8TC 8VB 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAPKM AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYXX ABAKF ABBBX ABBRH ABBXA ABDBE ABDZT ABECU ABFSG ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABRTQ ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSTC ACZOJ ADHHG ADHIR ADHKG ADIMF ADKFA ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AETLH AEVLU AEXYK AEZWR AFBBN AFDZB AFEXP AFFHD AFGCZ AFHIU AFKRA AFLOW AFOHR AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGQPQ AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHPBZ AHQJS AHSBF AHWEU AHYZX AIAKS AIGIU AIIXL AILAN AITGF AIXLP AJBLW AJRNO AJZVZ AKVCP ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMVHM AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG ATHPR AVWKF AXYYD AYFIA AYQZM AZFZN AZQEC B-. BA0 BAPOH BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU CITATION COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DWQXO EBLON EBO EBS EBU EDO EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ7 GQ8 GROUPED_ABI_INFORM_RESEARCH GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IAO ICD IEA IHE IJ- IKXTQ ITC ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K1G K60 K6V K6~ K7- KDC KOV KOW L6V LAK LLZTM M0C M2P M4Y M7S MA- N2Q N95 N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I OAM OVD P19 P2P P62 P9M PF0 PHGZM PHGZT PQBIZ PQBZA PQGLB PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS QWB R4E R89 R9I RHV RNI RNS ROL RPX RSV RZC RZD RZK S16 S1Z S26 S27 S28 S3B SAP SBE SCF SCLPG SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TH9 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 ZL0 ZMTXR ZYFGU ~8M ~A9 ~EX 3V. 7TA 7TB 7XB 8AL 8FD 8FK AESKC FR3 JG9 JQ2 KR7 L.- M0N PKEHL PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c332t-c6ab21f09bc7d83408ef0706d45ca879953325ffe34a8613e21e6142c7c8a5ee3 |
| IEDL.DBID | M2P |
| ISICitedReferencesCount | 26 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000081701800002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0254-5330 |
| IngestDate | Wed Nov 05 12:55:27 EST 2025 Sat Nov 29 07:53:25 EST 2025 Tue Nov 18 22:28:03 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | https://www.springernature.com/gp/researchers/text-and-data-mining |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c332t-c6ab21f09bc7d83408ef0706d45ca879953325ffe34a8613e21e6142c7c8a5ee3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| PQID | 214510027 |
| PQPubID | 25585 |
| PageCount | 17 |
| ParticipantIDs | proquest_journals_214510027 crossref_primary_10_1023_A_1018952429396 crossref_citationtrail_10_1023_A_1018952429396 |
| PublicationCentury | 1900 |
| PublicationDate | 1999-01-00 19990101 |
| PublicationDateYYYYMMDD | 1999-01-01 |
| PublicationDate_xml | – month: 01 year: 1999 text: 1999-01-00 |
| PublicationDecade | 1990 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Annals of operations research |
| PublicationYear | 1999 |
| Publisher | Springer Nature B.V |
| Publisher_xml | – name: Springer Nature B.V |
| References | T.H. Lai (325973_CR14) 1986; 23 A. Grama (325973_CR11) 1995; 7 T.H. Lai (325973_CR12) 1984; 27 J. Adams (325973_CR1) 1988; 34 M. Perregaard (325973_CR18) 1998; 83 325973_CR3 J. Clausen (325973_CR9) 1997; 8 325973_CR4 325973_CR2 T. Mautor (325973_CR16) 1994; 55 C. Nugent (325973_CR17) 1968; 16 J. Carlier (325973_CR6) 1990; 26 G.J. Li (325973_CR15) 1986; C-35 J. Carlier (325973_CR5) 1989; 35 T.H. Lai (325973_CR13) 1985; C-34 325973_CR7 B. Gendron (325973_CR10) 1994; 42 325973_CR8 |
| References_xml | – volume: 55 start-page: 281 year: 1994 ident: 325973_CR16 publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(94)90014-0 – volume: 8 start-page: 111 year: 1997 ident: 325973_CR9 publication-title: Computational Optimization and Applications doi: 10.1023/A:1008696503659 – volume: 34 start-page: 391 year: 1988 ident: 325973_CR1 publication-title: Management Science doi: 10.1287/mnsc.34.3.391 – ident: 325973_CR2 – ident: 325973_CR3 doi: 10.1007/BFb0027123 – volume: 7 start-page: 365 year: 1995 ident: 325973_CR11 publication-title: ORSA Journal of Computing doi: 10.1287/ijoc.7.4.365 – ident: 325973_CR7 – volume: 23 start-page: 119 year: 1986 ident: 325973_CR14 publication-title: Inf. Proc. Lett. doi: 10.1016/0020-0190(86)90109-2 – volume: 83 start-page: 137 year: 1998 ident: 325973_CR18 publication-title: Annals of Operations Research doi: 10.1023/A:1018903912673 – volume: 42 start-page: 1042 year: 1994 ident: 325973_CR10 publication-title: Operations Research doi: 10.1287/opre.42.6.1042 – volume: 27 start-page: 594 year: 1984 ident: 325973_CR12 publication-title: Comm. ACM doi: 10.1145/358080.358103 – ident: 325973_CR4 doi: 10.1007/3-540-60321-2_29 – ident: 325973_CR8 doi: 10.1007/978-1-4613-3400-2_7 – volume: 26 start-page: 269 year: 1990 ident: 325973_CR6 publication-title: Annals of Operations Research doi: 10.1007/BF03543071 – volume: 35 start-page: 164 year: 1989 ident: 325973_CR5 publication-title: Management Science doi: 10.1287/mnsc.35.2.164 – volume: C-34 start-page: 962 year: 1985 ident: 325973_CR13 publication-title: IEEE Trans. Comput. doi: 10.1109/TC.1985.6312201 – volume: C-35 start-page: 568 year: 1986 ident: 325973_CR15 publication-title: IEEE Trans. Comput. doi: 10.1109/TC.1986.5009434 – volume: 16 start-page: 150 year: 1968 ident: 325973_CR17 publication-title: Operations Research doi: 10.1287/opre.16.1.150 |
| SSID | ssj0001185 |
| Score | 1.6746044 |
| Snippet | The Best-First Search strategy (BeFS) and the Depth-First Search strategy (DFS) are regarded as the prime strategies when solving combinatorial optimization... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 1 |
| SubjectTerms | Algorithms Children & youth Efficiency Experiments Job shops Operations research Optimization Scheduling Studies |
| Title | On the best search strategy in parallel branch‐and‐bound:Best‐First Search versus Lazy Depth‐First Search |
| URI | https://www.proquest.com/docview/214510027 |
| Volume | 90 |
| WOSCitedRecordID | wos000081701800002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: 7WY dateStart: 19990101 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: M0C dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: P5Z dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: AUTh Library subscriptions: ProQuest Central customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: BENPR dateStart: 19990101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: K7- dateStart: 19990101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: M7S dateStart: 19990101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: M2P dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1572-9338 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3LTtwwFL0qD6F2UWAA8WhHXnTRjdu8nDhsKkCgSsB01BZBu4n8ipgqCsNkqARf33vzmM4s2g0bS5ZtJdK1r4_to3MA3sVCR5FQeCyxccyjRMRc4smDR1oqq51SpnEtuUgGA3lzkw5bbk7V0iq7nFgnantn6I78Iylqk1xo8ml8z8k0ih5XWweNJVhBYOMTo-syGM4SMWLnmsGIZyBOJMo5ZR91SEpVqcANKg1JsH9-U1rMyfVGc7b-zF_cgNctwmRHzZTYhBeu7MFaR3DvwXpn5MDadd2DV3OqhFvw60vJEBYyjV9mzUpgVSNi-8hGJSO18KJwBdNkynHLVWm5JnemQ3aMQ3g-mvwdSKyPh4oV6umRWTee3i40b8PV2en3k8-8tWTgJgyDKTex0oGfe6k2iZVh5EmXY9KIbSSMkiQuh91EnrswUhKRggt8hwAgMImRSjgX7sByeVe6XWC-DXyDcDF3eR7FsUk9oTXWRSqtUp7bgw9dTDLT6pWTbUaR1e_mQZgdZQtB3IP3swHjRqrj310Pughm7Zqtsln49v_begAvG-kGuoZ5A8vTyYN7C6vm93RUTfqwlFz_6MPK8elg-BVr5wnH8tI76ddzk8rkG5ZD8fMPZWvn_Q |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3LbtNAFL0qBVFYUAggSnnMAiQ2A8l4xh5XQqg8qlYNoYsidefOy2oqyw1xCgr_xD9yrx8hWcCuC5bWeCzN-Og-xsfnALyIlZVSGWxLfBxzmaiYa-w8uLTaeBuMcY1ryTAZjfTJSXq0Br-6f2GIVtnFxDpQ-wtHZ-RvSFGb5EKTd5NvnEyj6ONq56DRoOIwzH9gx1a9PfiIr_elEHufjj_s89ZUgLsoEjPuYmPFIO-n1iVeR7KvQ46wj71UzmiSR8PbVJ6HSBqNuS6IQcAUJlzitFEhRPjca3BdkrAYMQXF0SLwY61eMyax5-JE2lxSEjI7pIyVKkyIaUQGActJcDUH1Iltb_M_25K7cKetoNluA_l7sBbKHtzsCPw92OyMKlgbt3pwe0l18T6cfykZlr3M4kpZswBWNSK9czYuGamhF0UomCXTkTNuSs8tuU_tsPc4hefj6Z-JxGq5rFhhfs6ZD5PZ2crwA_h6JVvxENbLizI8AjbwYuCwHM5Dnss4dmlfWYvXKtXemH7YgtcdBjLX6rGTLUiR1bwAEWW72QpotuDVYsKkkSL5-63bHWKyNiZV2QIuj_85-hw29o8_D7PhwehwG241MhV05PQE1mfTy_AUbrjvs3E1fVajn8HpVWPrN_qdPdE |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3LbtNAFL0qLapgQSGAKG1hFiCxGZrYHntcCaE-iKhahSxAqti481SDLDfEKSj9s_4d9_oRkkXZdcHSmhlLM75zHzPH5wC8iYWOIqGwLLFxzKNExFxi5cEjLZXVTilTq5acJoOBPDtLhytw0_4LQ7DK1idWjtpeGjoj3yVGbaILTXZ9g4oYHvU_jn9yEpCii9ZWTaO2kBM3-43VW_nh-Ag_9dsg6H_6eviZNwID3IRhMOUmVjro-W6qTWJlGHWl87gFYhsJoyRRpWE34b0LIyUx7rmg5zCcBSYxUgnnQnzvPVhLsMQkNOFQfJ8HAczbK_Qk1l-cAJwLrEJqj1iyUoHBMQ1JLGAxIC7HgyrI9Tf-4-V5DI-azJrt11vhCay4ogPrLbC_AxutgAVr_FkHHi6wMT6FH18Khukw0zhrVk-AlTV574yNCkYs6XnucqZJjOSCq8JyTapUe-wAh3A_mvwdSGiXq5Ll6nrGrBtPL5aan8G3O1mK57BaXBbuBbCeDXoG02TvvI_i2KRdoTU-i1RapbpuE9639pCZhqed5ELyrMILBGG2ny0Z0Ca8mw8Y1xQlt3fdaq0na3xVmc1N5-U_W1_DOppUdno8ONmCBzV7BZ1EbcPqdHLlduC--TUdlZNX1UZgcH7XpvUHkVVGvQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+the+best+search+strategy+in+parallel+branch-and-bound%3A+Best-first+search+versus+lazy+depth-first+search&rft.jtitle=Annals+of+operations+research&rft.au=Clausen%2C+Jens&rft.au=Perregaard%2C+Michael&rft.date=1999-01-01&rft.pub=Springer+Nature+B.V&rft.issn=0254-5330&rft.eissn=1572-9338&rft.volume=90&rft.spage=1&rft_id=info:doi/10.1023%2Fa%3A1018952429396&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=405817751 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0254-5330&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0254-5330&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0254-5330&client=summon |