{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T10:40:08Z","timestamp":1746355208511,"version":"3.40.4"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319125671"},{"type":"electronic","value":"9783319125688"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44739-0_70","type":"book-chapter","created":{"date-parts":[[2014,8,26]],"date-time":"2014-08-26T02:56:21Z","timestamp":1409021781000},"page":"572-579","source":"Crossref","is-referenced-by-count":5,"title":["An Analogy between Bin Packing Problem and Permutation Problem: A New Encoding Scheme"],"prefix":"10.1007","author":[{"given":"Michel","family":"Gourgand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nathalie","family":"Grangeon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nathalie","family":"Klement","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"70_CR1","unstructured":"Johnson, D.S.: Near-optimalbin packing algorithms. PhD thesis, Massachusetts Instituteof Technology (1973)"},{"key":"70_CR2","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1287\/opre.26.5.760","volume":"26","author":"A. Chandra","year":"1978","unstructured":"Chandra, A., Hirschberg, D., Wong, C.: Bin packing with geometric constraintsin computer network design. Operations Research\u00a026, 760\u2013772 (1978)","journal-title":"Operations Research"},{"key":"70_CR3","unstructured":"Bortfeldt, A., W\u00e4scher, G.: Container loading problems: Astate-of-the-artreview. Univ., Faculty of Economics and Management (2012)"},{"key":"70_CR4","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/0167-6377(82)90046-3","volume":"1","author":"T. Wee","year":"1982","unstructured":"Wee, T., Magazine, M.J.: Assembly line balancingas generalized bin packing. Operations Research Letters\u00a01, 56\u201358 (1982)","journal-title":"Operations Research Letters"},{"key":"70_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"E.G. Coffman Jr","year":"1978","unstructured":"Coffman Jr, E.G., Garey, M.R., Johnson, D.S.: An application of bin-packingto multiprocessor scheduling. SIAM Journal on Computing\u00a07, 1\u201317 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"70_CR6","doi-asserted-by":"crossref","unstructured":"Gourgand, M., Grangeon, N., Klement, N.: Activities planning and resource assign- menton multi-place hospital system: Exactand approach methods adapted from the bin packing problem. In: 7th International Conference on Health Informatics, Angers, France, pp. 117\u2013124 (2014)","DOI":"10.5220\/0004803901170124"},{"key":"70_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. WH Freeman and Company, NewYork (1979)"},{"key":"70_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1023\/B:HEUR.0000026267.44673.ed","volume":"10","author":"A.C. Alvim","year":"2004","unstructured":"Alvim, A.C., Ribeiro, C.C., Glover, F., Aloise, D.J.: A hybrid improvement heuris- tic for the one-dimensional bin packing problem. Journal of Heuristic\u00a010, 205\u2013229 (2004)","journal-title":"Journal of Heuristic"},{"key":"70_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E. Falkenauer","year":"1996","unstructured":"Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. Journal of Heuristic\u00a02, 5\u201330 (1996)","journal-title":"Journal of Heuristic"},{"key":"70_CR10","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 Applied Mathematics\u00a028, 59\u201370 (1990)","journal-title":"Discrete Applied Mathematics"},{"key":"70_CR11","doi-asserted-by":"publisher","first-page":"2283","DOI":"10.1016\/j.cor.2006.10.021","volume":"35","author":"K.H. Loh","year":"2008","unstructured":"Loh, K.H., Golden, B., Wasil, E.: Solving the one-dimensional bin packing problem with a weight annealing heuristic. Computers & Operations Research\u00a035, 2283\u20132291 (2008)","journal-title":"Computers & Operations Research"},{"key":"70_CR12","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1057\/palgrave.jors.2601771","volume":"55","author":"J. Levine","year":"2004","unstructured":"Levine, J., Ducatelle, F.: Ant colony optimization and local search for bin packing and cutting stock problems. Journal of the Operational Research Society\u00a055, 705\u2013716 (2004)","journal-title":"Journal of the Operational Research Society"},{"key":"70_CR13","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/BF02125404","volume":"63","author":"C. Reeves","year":"1996","unstructured":"Reeves, C.: Hybrid genetical gorithms for bin-packing and related problems. Annals of Operations Research\u00a063, 371\u2013396 (1996)","journal-title":"Annals of Operations Research"},{"key":"70_CR14","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/j.cie.2008.01.007","volume":"55","author":"A. Stawowy","year":"2008","unstructured":"Stawowy, A.: Evolutionary based heuristic for bin packing problem. Computers & Industrial Engineering\u00a055, 465\u2013474 (2008)","journal-title":"Computers & Industrial Engineering"},{"key":"70_CR15","doi-asserted-by":"crossref","unstructured":"Falkenauer, E., Delchambre, A.: A genetic algorithm for bin packing and line balancing. In: International Conference on Robotics and Automation, pp. 1186\u20131192. IEEE (1992)","DOI":"10.1109\/ROBOT.1992.220088"},{"key":"70_CR16","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. The Journal of Chemical Physics\u00a021, 1087\u20131092 (1953)","journal-title":"The Journal of Chemical Physics"},{"key":"70_CR17","doi-asserted-by":"crossref","unstructured":"Aarts, E.H., van Laarhoven, P.J.: Simulated Annealing: Theory and Applications. Kluwer Academic Publishers (1987)","DOI":"10.1007\/978-94-015-7744-1"},{"key":"70_CR18","unstructured":"Fleury, G.: M\u00e9thodes stochastiques etd\u00e9terministes pour les probl\u00e9mes NP- difficiles. Ph.D.thesis, Universit\u00e9 Blaise Pascal, Clermont-FerrandII (1993)"}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44739-0_70","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T10:17:31Z","timestamp":1746353851000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44739-0_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319125671","9783319125688"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44739-0_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}