{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:23:09Z","timestamp":1743006189385,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031340192"},{"type":"electronic","value":"9783031340208"}],"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-34020-8_13","type":"book-chapter","created":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T10:02:30Z","timestamp":1685095350000},"page":"175-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Application of\u00a0Machine Learning Tools to\u00a0Predict the\u00a0Number of\u00a0Solutions for\u00a0a\u00a0Minimum Cardinality Set Covering Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0469-7258","authenticated-orcid":false,"given":"Brooks","family":"Emerick","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7988-2242","authenticated-orcid":false,"given":"Myung Soon","family":"Song","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2296-425X","authenticated-orcid":false,"given":"Yun","family":"Lu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8975-0999","authenticated-orcid":false,"given":"Francis","family":"Vasko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,27]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Bixby, R.E.: A brief history of linear and mixed-integer programming computation. Doc. Math. Extra Vol. ISMP 107\u2013121 (2012)","DOI":"10.4171\/dms\/6\/16"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.12928\/ijio.v2i1.2948","volume":"2","author":"B Emerick","year":"2021","unstructured":"Emerick, B., Lu, Y., Vasko, F.: Using machine learning to predict the number of alternative solutions to a minimum cardinality set covering problem. Int. J. Industr. Optim. 2(1), 1\u201316 (2021)","journal-title":"Int. J. Industr. Optim."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Jolliffe, I.T., Cadima, J.: Principal component analysis: a review and recent developments. Philos. Trans. Roy. Soc. A: Math. Phys. Eng. Sci. 374(2065) (2016)","DOI":"10.1098\/rsta.2015.0202"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds) Complexity of Computer Computations, Plenum, NY, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejco.2022.100031","volume":"10","author":"T Koch","year":"2022","unstructured":"Koch, T., Berthold, T., Pedersen, J., Vanaret, C.: Progress in mathematical programming solvers from 2001 to 2020. EURO J. Comput. Optim. 10, 1\u201317 (2022)","journal-title":"EURO J. Comput. Optim."},{"key":"13_CR6","unstructured":"MATLAB: Statistics and Machine Learning Toolbox Users Guide. R2020a, 1 Apple Hill Dr, Natick, MA 01760-2098 (2020)"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1057\/jors.1993.113","volume":"44","author":"DD Newhart","year":"1993","unstructured":"Newhart, D.D., Stott, K.L., Vasko, F.J.: Consolidating product sizes to minimize inventory levels for a multi-stage production and distribution system. J. Oper. Res. Soc. 44, 637\u2013644 (1993)","journal-title":"J. Oper. Res. Soc."},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/opre.35.3.346","volume":"35","author":"FJ Vasko","year":"1987","unstructured":"Vasko, F.J., Wolf, F.E., Stott, K.L.: Optimal selection of ingot sizes via set covering. Oper. Res. 35, 346\u2013353 (1987)","journal-title":"Oper. Res."},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0377-2217(89)90465-7","volume":"38","author":"FJ Vasko","year":"1989","unstructured":"Vasko, F.J., Wolf, F.E., Stott, K.L.: A set covering approach to metallurgical grade assignment. Eur. J. Oper. Res. 38, 27\u201334 (1989)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0895-7177(92)90075-V","volume":"16","author":"FJ Vasko","year":"1992","unstructured":"Vasko, F.J., Wolf, F.E., Stott, K.L., Ehrsam, O.: Bethlehem Steel combines cutting stock and set covering to enhance customer service. Math. Comput. Modell. 16(1), 9\u201317 (1992)","journal-title":"Math. Comput. Modell."}],"container-title":["Communications in Computer and Information Science","Optimization and Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34020-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T10:09:07Z","timestamp":1685095747000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34020-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031340192","9783031340208"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34020-8_13","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malaga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ola2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ola2023.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"sciencesconf.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","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":"32","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":"41% - 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":"3","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","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}