{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T18:25:01Z","timestamp":1745432701020,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030192112"},{"type":"electronic","value":"9783030192129"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19212-9_16","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:32:32Z","timestamp":1558348352000},"page":"241-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["An Investigation into Prediction\u00a0+\u00a0Optimisation for the Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Emir","family":"Demirovi\u0107","sequence":"first","affiliation":[]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[]},{"given":"James","family":"Bailey","sequence":"additional","affiliation":[]},{"given":"Jeffrey","family":"Chan","sequence":"additional","affiliation":[]},{"given":"Chris","family":"Leckie","sequence":"additional","affiliation":[]},{"given":"Kotagiri","family":"Ramamohanarao","sequence":"additional","affiliation":[]},{"given":"Tias","family":"Guns","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,28]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","unstructured":"Bessiere, C., Koriche, F., Lazaar, N., O\u2019Sullivan, B.: Constraint acquisition. Artif. Intell. 244, 315\u2013342 (2017). https:\/\/doi.org\/10.1016\/j.artint.2015.08.001 , http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0004370215001162 , combining Constraint Solving with Mining and Learning","DOI":"10.1016\/j.artint.2015.08.001"},{"issue":"5","key":"16_CR2","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/widm.1157","volume":"5","author":"H Borchani","year":"2015","unstructured":"Borchani, H., Varando, G., Bielza, C., Larra\u00f1aga, P.: A survey on multi-output regression. Wiley Interdisc. Rev. Data Min. Knowl. Dis. 5(5), 216\u2013233 (2015)","journal-title":"Wiley Interdisc. Rev. Data Min. Knowl. Dis."},{"issue":"1","key":"16_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T Cover","year":"1967","unstructured":"Cover, T., Hart, P.: Nearest neighbor pattern classification. IEEE Trans. Inform. Theory 13(1), 21\u201327 (1967)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1016\/j.ejor.2015.08.018","volume":"248","author":"G Liberto Di","year":"2016","unstructured":"Di Liberto, G., Kadioglu, S., Leo, K., Malitsky, Y.: Dash: dynamic approach for switching heuristics. Eur. J. Oper. Res. 248(3), 943\u2013953 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR5","unstructured":"Donti, P.L., Amos, B., Kolter, J.Z.: Task-based end-to-end model learning in stochastic optimization. In: Proceedings of the 31st Conference on Neural Information Processing Systems (NIPS 2017), pp. 5484\u20135494 (2017)"},{"issue":"1\u20132","key":"16_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s13675-016-0072-0","volume":"5","author":"DVD Dooren","year":"2017","unstructured":"Dooren, D.V.D., Sys, T., Toffolo, T.A.M., Wauters, T., Berghe, V.: Multi-machine energy-aware scheduling. EURO J. Comput. Optim. 5(1\u20132), 285\u2013307 (2017). https:\/\/doi.org\/10.1007\/s13675-016-0072-0","journal-title":"EURO J. Comput. Optim."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Dragone, P., Teso, S., Passerini, A.: Pyconstruct: constraint programming meets structured prediction. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, pp. 5823\u20135825. International Joint Conferences on Artificial Intelligence Organization, July 2018","DOI":"10.24963\/ijcai.2018\/850"},{"key":"16_CR8","unstructured":"Elmachtoub, A.N., Grigas, P.: Smart \u201cpredict, then optimize\u201d. Technical report (2017). https:\/\/arxiv.org\/pdf\/1710.08005.pdf"},{"issue":"6","key":"16_CR9","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1287\/opre.14.6.1045","volume":"14","author":"P Gilmore","year":"1966","unstructured":"Gilmore, P., Gomory, R.E.: The theory and computation of knapsack functions. Oper. Res. 14(6), 1045\u20131074 (1966)","journal-title":"Oper. Res."},{"key":"16_CR10","doi-asserted-by":"publisher","unstructured":"Grimes, D., Ifrim, G., O\u2019Sullivan, B., Simonis, H.: Analyzing the impact of electricity price forecasting on energy cost-aware scheduling. Sustain. Comput. Inform. Syst. 4(4), 276\u2013291 (2014). https:\/\/doi.org\/10.1016\/j.suscom.2014.08.009, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S221053791400050X , special Issue on Energy Aware Resource Management and Scheduling (EARMS)","DOI":"10.1016\/j.suscom.2014.08.009,"},{"key":"16_CR11","unstructured":"Joachims, T.: Making large-scale svm learning practical. Technical report, SFB 475: Komplexit\u00e4tsreduktion in Multivariaten Datenstrukturen, Universit\u00e4t Dortmund (1998)"},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Joachims, T.: Optimizing search engines using click through data. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2002, pp. 133\u2013142. ACM, New York (2002). https:\/\/doi.org\/10.1145\/775047.775067 , http:\/\/doi.acm.org\/10.1145\/775047.775067","DOI":"10.1145\/775047.775067"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Training linear SVMs in linear time. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 217\u2013226. ACM (2006)","DOI":"10.1145\/1150402.1150429"},{"issue":"3","key":"16_CR14","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1609\/aimag.v35i3.2460","volume":"35","author":"L Kotthoff","year":"2014","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. AI Mag. 35(3), 48\u201360 (2014). http:\/\/www.aaai.org\/ojs\/index.php\/aimagazine\/article\/view\/2460","journal-title":"AI Mag."},{"issue":"3","key":"16_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1561\/1500000016","volume":"3","author":"TY Liu","year":"2009","unstructured":"Liu, T.Y., et al.: Learning to rank for information retrieval. Found. Trends Inf. Retrieval 3(3), 225\u2013331 (2009)","journal-title":"Found. Trends Inf. Retrieval"},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Mathaba, T., Xia, X., Zhang, J.: Analysing the economic benefit of electricity price forecast in industrial load scheduling. Electric Power Syst. Res. 116, 158\u2013165 (2014). https:\/\/doi.org\/10.1016\/j.epsr.2014.05.008 , http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0378779614001886","DOI":"10.1016\/j.epsr.2014.05.008"},{"key":"16_CR17","first-page":"486","volume":"28","author":"G Matthews","year":"1897","unstructured":"Matthews, G.: On the partition of numbers. Proc. Lond. Math. Soc. 28, 486\u2013490 (1897)","journal-title":"Proc. Lond. Math. Soc."},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2017.01.002","volume":"244","author":"A Passerini","year":"2017","unstructured":"Passerini, A., Tack, G., Guns, T.: Introduction to the special issue on combining constraint solving with mining and learning. Artif. Intell. 244, 1\u20135 (2017). https:\/\/doi.org\/10.1016\/j.artint.2017.01.002","journal-title":"Artif. Intell."},{"key":"16_CR19","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-319-66158-2_33","volume-title":"Principles and Practice of Constraint Programming","author":"\u00c9 Picard-Cantin","year":"2017","unstructured":"Picard-Cantin, \u00c9., Bouchard, M., Quimper, C.-G., Sweeney, J.: Learning the parameters of global constraints using branch-and-bound. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 512\u2013528. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66158-2_33"},{"key":"16_CR21","doi-asserted-by":"publisher","DOI":"10.1002\/0471722138","volume-title":"Introduction to Stochastic Search and Optimization","author":"J Spall","year":"2003","unstructured":"Spall, J.: Introduction to Stochastic Search and Optimization. Wiley, New York (2003)"},{"key":"16_CR22","unstructured":"Teso, S., Passerini, A., Viappiani, P.: Constructive preference elicitation by setwise max-margin learning. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9\u201315 July 2016, pp. 2067\u20132073 (2016)"},{"key":"16_CR23","unstructured":"Vapnik, V.: Principles of risk minimization for learning theory. In: Advances in Neural Information Processing Systems, pp. 831\u2013838 (1992)"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Wilder, B., Dilkina, B., Tambe, M.: Melding the data-decisions pipeline: Decision-focused learning for combinatorial optimization. In: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI 2019) (2019, to appear). https:\/\/arxiv.org\/pdf\/1809.05504.pdf","DOI":"10.1609\/aaai.v33i01.33011658"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19212-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T16:58:35Z","timestamp":1574701115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19212-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030192112","9783030192129"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19212-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2019b","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cpaior2019.uowm.gr\/","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"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"94","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36% - 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"}},{"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"}},{"value":"5.67","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}