{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:31:07Z","timestamp":1759847467509,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046507"},{"type":"electronic","value":"9783030046514"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04651-4_30","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T19:56:50Z","timestamp":1542311810000},"page":"449-462","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Heuristics for the Score-Constrained Strip-Packing Problem"],"prefix":"10.1007","author":[{"given":"Asyl L.","family":"Hawa","sequence":"first","affiliation":[]},{"given":"Rhyd","family":"Lewis","sequence":"additional","affiliation":[]},{"given":"Jonathan M.","family":"Thompson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"key":"30_CR1","unstructured":"Becker, K.H.: Twin-constrained Hamiltonian paths on threshold graphs - an approach to the minimum score separation problem. Ph.D. thesis, London School of Economics (2010)"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"D\u00f3sa, G.: The tight bound of first fit decreasing bin-packing algorithm is $$FFD (I) \\le 11\/9 OPT (I)+ 6\/9$$. In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, pp. 1\u201311 (2007)","DOI":"10.1007\/978-3-540-74450-4_1"},{"key":"30_CR3","first-page":"90","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, pp. 90\u201391. WH Freeman Co., San Francisco (1979)"},{"issue":"12","key":"30_CR4","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1057\/palgrave.jors.2601835","volume":"55","author":"C Goulimis","year":"2004","unstructured":"Goulimis, C.: Minimum score separation - an open combinatorial problem associated with the cutting stock problem. J. Oper. Res. Soc. 55(12), 1367\u20131368 (2004)","journal-title":"J. Oper. Res. Soc."},{"key":"30_CR5","unstructured":"H\u00e4ggkvist, R.: On F-Hamiltonian graphs. University of Ume\u00e5, Department of Mathematics (1977)"},{"key":"30_CR6","doi-asserted-by":"publisher","unstructured":"Hawa, A.L., Lewis, R., Thompson, J.: Source code for algorithms in the article \u201cHeuristics for the Score-Constrained Strip-Packing Problem\u201d (2018). https:\/\/doi.org\/10.5281\/zenodo.1311857","DOI":"10.5281\/zenodo.1311857"},{"key":"30_CR7","unstructured":"Johnson, D.S.: Near-optimal bin packing algorithms. Ph.D. thesis, Massachusetts Institute of Technology (1973)"},{"issue":"7","key":"30_CR8","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1016\/j.cor.2008.09.004","volume":"36","author":"R Lewis","year":"2009","unstructured":"Lewis, R.: A general-purpose hill-climbing method for order independent minimum grouping problems: a case study in graph colouring and bin packing. Comput. Oper. Res. 36(7), 2295\u20132310 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"30_CR9","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.ejor.2011.03.016","volume":"213","author":"R Lewis","year":"2011","unstructured":"Lewis, R., Song, X., Dowsland, K., Thompson, J.: An investigation into two bin packing problems with ordering and orientation implications. Eur. J. Oper. Res. 213(1), 52\u201365 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20133","key":"30_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0012-365X(93)E0077-H","volume":"135","author":"NV Mahadev","year":"1994","unstructured":"Mahadev, N.V., Peled, U.N.: Longest cycles in threshold graphs. Discrete Math. 135(1\u20133), 169\u2013176 (1994)","journal-title":"Discrete Math."},{"issue":"2","key":"30_CR11","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1287\/ijoc.1070.0245","volume":"20","author":"E Malaguti","year":"2008","unstructured":"Malaguti, E., Monaci, M., Toth, P.: A metaheuristic approach for the vertex coloring problem. INFORMS J. Comput. 20(2), 302\u2013316 (2008)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"30_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0166-218X(90)90094-S","volume":"28","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Lower bounds and reduction procedures for the bin packing problem. Discrete Appl. Math. 28(1), 59\u201370 (1990)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04651-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:50:09Z","timestamp":1710345009000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}