{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:51:39Z","timestamp":1743036699147,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031360237"},{"type":"electronic","value":"9783031360244"}],"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-36024-4_40","type":"book-chapter","created":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T15:17:07Z","timestamp":1687879027000},"page":"528-535","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Semi-supervised Learning Approach to\u00a0Efficient Cut Selection in\u00a0the\u00a0Branch-and-Cut Framework"],"prefix":"10.1007","author":[{"given":"Jia He","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salimur","family":"Choudhury","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,26]]},"reference":[{"key":"40_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108353","volume":"123","author":"Z Huang","year":"2022","unstructured":"Huang, Z., et al.: Learning to select cuts for efficient mixed-integer programming. Pattern Recogn. 123, 108353 (2022)","journal-title":"Pattern Recogn."},{"key":"40_CR2","unstructured":"Tang, Y., Agrawal, S., Faenza, Y.: Reinforcement learning for integer programming: Learning to cut. In: International Conference On Machine Learning, pp. 9367\u20139376. PMLR (2020)"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Khalil, E.B., Dilkina, B., Nemhauser, G.L., Ahmed, S., Shao, Y.: Learning to Run Heuristics in Tree Search. In: Ijcai, pp. 659\u2013666 (2017)","DOI":"10.24963\/ijcai.2017\/92"},{"key":"40_CR4","unstructured":"He, H., Daume III, H., Eisner, J.M.: Learning to search in branch and bound algorithms. In: Advances in Neural Information Processing Systems, vol. 27 (2014)"},{"key":"40_CR5","unstructured":"Balcan, M.F., Dick, T., Sandholm, T., Vitercik, E.: Learning to branch. In: International Conference On Machine Learning, pp. 344\u2013353. PMLR (2018)"},{"key":"40_CR6","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, No. 1 (2016)","DOI":"10.1609\/aaai.v30i1.10080"},{"issue":"1","key":"40_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1080\/00207729708929360","volume":"28","author":"CH Pan","year":"1997","unstructured":"Pan, C.H.: A study of integer programming formulations for scheduling problems. Int. J. Syst. Sci. 28(1), 33\u201341 (1997)","journal-title":"Int. J. Syst. Sci."},{"issue":"10","key":"40_CR8","first-page":"1251","volume":"42","author":"V Guihaire","year":"2008","unstructured":"Guihaire, V., Hao, J.K.: Transit network design and scheduling: a global review. Transp. Res. Part A: Policy Pract. 42(10), 1251\u20131273 (2008)","journal-title":"Transp. Res. Part A: Policy Pract."},{"issue":"17","key":"40_CR9","doi-asserted-by":"publisher","first-page":"5171","DOI":"10.1080\/00207543.2014.899721","volume":"52","author":"M D\u00edaz-Madro\u00f1ero","year":"2014","unstructured":"D\u00edaz-Madro\u00f1ero, M., Mula, J., Peidro, D.: A review of discrete-time optimization models for tactical production planning. Int. J. Prod. Res. 52(17), 5171\u20135205 (2014)","journal-title":"Int. J. Prod. Res."},{"key":"40_CR10","unstructured":"Huang, L., et al.: Branch and bound in mixed integer linear programming problems: A survey of techniques and trends (2021). arXiv preprint arXiv:2111.06257"},{"key":"40_CR11","unstructured":"Wesselmann, F., Stuhl, U.: Implementing cutting plane management and selection techniques. In: Technical Report. University of Paderborn (2012)"},{"issue":"3","key":"40_CR12","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s12532-020-00194-3","volume":"13","author":"A Gleixner","year":"2021","unstructured":"Gleixner, A., et al.: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13(3), 443\u2013490 (2021)","journal-title":"Math. Program. Comput."},{"key":"40_CR13","unstructured":"Paulus, M.B., Zarpellon, G., Krause, A., Charlin, L., Maddison, C.: Learning to cut by looking ahead: Cutting plane selection via imitation learning. In: International Conference on Machine Learning, pp. 17584\u201317600 (2022). PMLR"},{"issue":"1\u20133","key":"40_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10107-003-0400-z","volume":"98","author":"A Atamt\u00fcrk","year":"2003","unstructured":"Atamt\u00fcrk, A.: On the facets of the mixed-integer knapsack polyhedron. Math. Program. 98(1\u20133), 145\u2013175 (2003)","journal-title":"Math. Program."},{"key":"40_CR15","doi-asserted-by":"publisher","unstructured":"Forrest, J. coin-or\/Cbc: Release releases\/2.10.8. Zenodo. https:\/\/doi.org\/10.5281\/zenodo.6522795 (2022)","DOI":"10.5281\/zenodo.6522795"},{"issue":"3","key":"40_CR16","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10107-003-0465-8","volume":"99","author":"A Atamt\u00fcrk","year":"2004","unstructured":"Atamt\u00fcrk, A., Munoz, J.C.: A study of the lot-sizing polytope. Math. Program. 99(3), 443\u2013465 (2004)","journal-title":"Math. Program."},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"Arik, S.\u00d6., Pfister, T.: Tabnet: Attentive interpretable tabular learning. In: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 35, No. 8, pp. 6679\u20136687 (2021)","DOI":"10.1609\/aaai.v35i8.16826"},{"issue":"1","key":"40_CR18","first-page":"65","volume":"1","author":"JE Mitchell","year":"2002","unstructured":"Mitchell, J.E.: Branch-and-cut algorithms for combinatorial optimization problems. Handbook Appl. Optimization 1(1), 65\u201377 (2002)","journal-title":"Handbook Appl. Optimization"},{"issue":"4","key":"40_CR19","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1504\/IJOR.2010.034067","volume":"8","author":"M Diaby","year":"2010","unstructured":"Diaby, M.: Linear programming formulation of the set partitioning problem. Int. J. Oper. Res. 8(4), 399\u2013427 (2010)","journal-title":"Int. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36024-4_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T13:08:55Z","timestamp":1723554535000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36024-4_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031360237","9783031360244"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36024-4_40","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":"26 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","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":"3 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"530","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":"188","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":"94","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":"35% - 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":"2,8","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":"3,2","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)"}}]}}