{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:13:04Z","timestamp":1742994784990,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031445040"},{"type":"electronic","value":"9783031445057"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-44505-7_37","type":"book-chapter","created":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T18:03:41Z","timestamp":1698170621000},"page":"552-566","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learn, Compare, Search: One Sawmill\u2019s Search for\u00a0the\u00a0Best Cutting Patterns Across and\/or Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8776-5166","authenticated-orcid":false,"given":"Marc-Andr\u00e9","family":"M\u00e9nard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1008-4303","authenticated-orcid":false,"given":"Michael","family":"Morin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7402-3991","authenticated-orcid":false,"given":"Mohammed","family":"Khachan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5493-8836","authenticated-orcid":false,"given":"Jonathan","family":"Gaudreault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5899-0217","authenticated-orcid":false,"given":"Claude-Guy","family":"Quimper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,25]]},"reference":[{"issue":"1","key":"37_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/ijoc.2016.0723","volume":"29","author":"AM Alvarez","year":"2017","unstructured":"Alvarez, A.M., Louveaux, Q., Wehenkel, L.: A machine learning-based approximation of strong branching. INFORMS J. Comput. 29(1), 185\u2013195 (2017)","journal-title":"INFORMS J. Comput."},{"key":"37_CR2","unstructured":"Antuori, V., H\u00e9brard, E., Huguet, M.J., Essodaigui, S., Nguyen, A.: Combining Monte Carlo tree search and depth first search methods for a car manufacturing workshop scheduling problem. In: International Conference on Principles and Practice of Constraint Programming (CP) (2021)"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Bachiri, I., Gaudreault, J., Quimper, C.G., Chaib-draa, B.: RLBS: an adaptive backtracking strategy based on reinforcement learning for combinatorial optimization. In: 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 936\u2013942. IEEE (2015)","DOI":"10.1109\/ICTAI.2015.135"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1613\/jair.2169","volume":"29","author":"JC Beck","year":"2007","unstructured":"Beck, J.C.: Solution-guided multi-point constructive search for job shop scheduling. J. Artif. Intell. Res. 29, 49\u201377 (2007)","journal-title":"J. Artif. Intell. Res."},{"key":"37_CR5","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Proceedings of the 16th European Conference on Artificial Intelligence (ECAI), vol. 16 (2004)"},{"issue":"1","key":"37_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"CB Browne","year":"2012","unstructured":"Browne, C.B., et al.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201343 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Chabanet, S., Thomas, P., El Haouzi, H.B., Morin, M., Gaudreault, J.: A kNN approach based on ICP metrics for 3D scans matching: an application to the sawing process. In: 17th IFAC Symposium on Information Control Problems in Manufacturing (INCOM) (2021)","DOI":"10.1016\/j.ifacol.2021.08.045"},{"key":"37_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-319-18008-3_8","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"G Chu","year":"2015","unstructured":"Chu, G., Stuckey, P.J.: Learning value heuristics for constraint programming. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 108\u2013123. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18008-3_8"},{"key":"37_CR9","unstructured":"Drake, P., Uurtamo, S.: Move ordering vs heavy playouts: where should heuristics be applied in Monte Carlo go. In: Proceedings of the 3rd North American Game-On Conference, pp. 171\u2013175. Citeseer (2007)"},{"key":"37_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-20807-2_15","volume-title":"Integer Programming and Combinatoral Optimization","author":"M Fischetti","year":"2011","unstructured":"Fischetti, M., Monaci, M.: Backdoor branching. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol. 6655, pp. 183\u2013191. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20807-2_15"},{"key":"37_CR11","unstructured":"FPInnovations: Optitek 10. In: User\u2019s Manual (2014)"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Gaudreault, J., Pesant, G., Frayret, J.M., DAmours, S.: Supply chain coordination using an adaptive distributed search strategy. IEEE Trans. Syst. Man Cybern. Part C (Appl. Rev.) 42(6), 1424\u20131438 (2012)","DOI":"10.1109\/TSMCC.2012.2188627"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Glankwamdee, W., Linderoth, J.: Lookahead branching for mixed integer programming. In: Twelfth INFORMS Computing Society Meeting, pp. 130\u2013150 (2006)","DOI":"10.1287\/ics.2011.0010"},{"key":"37_CR14","unstructured":"HALCO: Halco Software Systems Ltd. (2016). https:\/\/www.halcosoftware.com"},{"key":"37_CR15","unstructured":"Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI), vol. 1, pp. 607\u2013615 (1995)"},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"121653","DOI":"10.1109\/ACCESS.2022.3223053","volume":"10","author":"SM Hosseini","year":"2022","unstructured":"Hosseini, S.M., Peer, A.: Wood products manufacturing optimization: a survey. IEEE Access 10, 121653\u2013121683 (2022)","journal-title":"IEEE Access"},{"key":"37_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-45783-6_12","volume-title":"Pattern Recognition","author":"T Jost","year":"2002","unstructured":"Jost, T., H\u00fcgli, H.: Fast ICP algorithms for shape registration. In: Van Gool, L. (ed.) DAGM 2002. LNCS, vol. 2449, pp. 91\u201399. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45783-6_12"},{"issue":"4","key":"37_CR18","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s12532-009-0009-1","volume":"1","author":"FK Karzan","year":"2009","unstructured":"Karzan, F.K., Nemhauser, G.L., Savelsbergh, M.W.: Information-based branching schemes for binary linear mixed integer problems. Math. Program. Comput. 1(4), 249\u2013293 (2009)","journal-title":"Math. Program. Comput."},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"Khalil, E., Le Bodic, P., Song, L., Nemhauser, G., Dilkina, B.: Learning to branch in mixed integer programming. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 30 (2016)","DOI":"10.1609\/aaai.v30i1.10080"},{"key":"37_CR20","unstructured":"Khalil, E.B.: Machine learning for integer programming. In: Proceedings of the Twenty-fifth International Joint Conference on Artificial Intelligence (IJCAI), pp. 4004\u20134005 (2016)"},{"key":"37_CR21","unstructured":"Korf, R.E.: Improved limited discrepancy search. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI), vol. 1, pp. 286\u2013291 (1996)"},{"key":"37_CR22","unstructured":"Larrosa Bondia, F.J., Roll\u00f3n Rico, E., Dechter, R.: Limited discrepancy and\/or search and its application to optimization tasks in graphical models. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI), pp. 617\u2013623. AAAI Press (Association for the Advancement of Artificial Intelligence) (2016)"},{"issue":"2","key":"37_CR23","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11750-017-0451-6","volume":"25","author":"A Lodi","year":"2017","unstructured":"Lodi, A., Zarpellon, G.: On learning and branching: a survey. TOP 25(2), 207\u2013236 (2017)","journal-title":"TOP"},{"key":"37_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-642-40627-0_36","volume-title":"Principles and Practice of Constraint Programming","author":"M Loth","year":"2013","unstructured":"Loth, M., Sebag, M., Hamadi, Y., Schoenauer, M.: Bandit-based search for constraint programming. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 464\u2013480. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40627-0_36"},{"key":"37_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-29828-8_15","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"L Michel","year":"2012","unstructured":"Michel, L., Van Hentenryck, P.: Activity-based search for black-box constraint programming solvers. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 228\u2013243. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29828-8_15"},{"key":"37_CR26","doi-asserted-by":"crossref","unstructured":"Ontan\u00f3n, S.: Informed Monte Carlo tree search for real-time strategy games. In: 2016 IEEE Conference on Computational Intelligence and Games (CIG), pp. 1\u20138. IEEE (2016)","DOI":"10.1109\/CIG.2016.7860394"},{"key":"37_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-540-30201-8_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P Refalo","year":"2004","unstructured":"Refalo, P.: Impact-based search strategies for constraint programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557\u2013571. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30201-8_41"},{"issue":"7587","key":"37_CR28","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver, D., et al.: Mastering the game of go with deep neural networks and tree search. Nature 529(7587), 484\u2013489 (2016)","journal-title":"Nature"},{"key":"37_CR29","doi-asserted-by":"crossref","unstructured":"\u015awiechowski, M., Godlewski, K., Sawicki, B., Ma\u0144dziuk, J.: Monte Carlo tree search: a review of recent modifications and applications. Artif. Intell. Rev. 1\u201366 (2022)","DOI":"10.1007\/s10462-022-10228-y"},{"key":"37_CR30","unstructured":"Thomas, R.E.: RAYSAW: a log sawing simulator for 3D laser-scanned hardwood logs. In: Proceedings of the 18th Central Hardwood Forest Conference, vol. 117, pp. 325\u2013334 (2012)"},{"key":"37_CR31","unstructured":"Walsh, T.: Depth-bounded discrepancy search. In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI), vol. 1, pp. 1388\u20131393 (1997)"},{"key":"37_CR32","doi-asserted-by":"crossref","unstructured":"Yang, Z., Ontan\u00f3n, S.: Guiding Monte Carlo tree search by scripts in real-time strategy games. In: Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AAAI), vol. 15, pp. 100\u2013106 (2019)","DOI":"10.1609\/aiide.v15i1.5231"},{"issue":"3","key":"37_CR33","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/s10601-008-9065-9","volume":"14","author":"A Zanarini","year":"2009","unstructured":"Zanarini, A., Pesant, G.: Solution counting algorithms for constraint-centered search heuristics. Constraints 14(3), 392\u2013413 (2009)","journal-title":"Constraints"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44505-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T19:11:21Z","timestamp":1730401881000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44505-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031445040","9783031445057"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44505-7_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lion17.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}