乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T07:11:31Z","timestamp":1726470691163},"reference-count":20,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2008,7,1]],"date-time":"2008-07-01T00:00:00Z","timestamp":1214870400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1016\/j.cor.2006.10.021","type":"journal-article","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T12:11:20Z","timestamp":1167394280000},"page":"2283-2291","source":"Crossref","is-referenced-by-count":47,"title":["Solving the one-dimensional bin packing problem with a weight annealing heuristic"],"prefix":"10.1016","volume":"35","author":[{"given":"Kok-Hua","family":"Loh","sequence":"first","affiliation":[]},{"given":"Bruce","family":"Golden","sequence":"additional","affiliation":[]},{"given":"Edward","family":"Wasil","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1979","series-title":"Computers and intractabililty: a guide to the theory of NP-completeness","author":"Garey","key":"10.1016\/j.cor.2006.10.021_bib1"},{"year":"1990","series-title":"Knapsack problems: algorithms and computer implementations","author":"Martello","key":"10.1016\/j.cor.2006.10.021_bib2"},{"key":"10.1016\/j.cor.2006.10.021_bib3","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/S0305-0548(96)00082-2","article-title":"BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem","volume":"24","author":"Scholl","year":"1997","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cor.2006.10.021_bib4","first-page":"111","article-title":"A new lower bound for the bin-packing problem and its integration into MTP and BISON","volume":"19","author":"Schwerin","year":"1999","journal-title":"Pesquisa Operacional"},{"key":"10.1016\/j.cor.2006.10.021_bib5","unstructured":"Coffman E, Garey M, Johnson D. Approximation algorithms for bin packing: a survey in: Approximation algorithms for NP-hard problems [D. Hochbaum, editor], vol. 46\u201393. Boston, MA: PWS Publishing; 1997."},{"key":"10.1016\/j.cor.2006.10.021_bib6","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1016\/S0305-0548(00)00082-4","article-title":"New heuristics for one-dimensional bin-packing","volume":"29","author":"Fleszar","year":"2002","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cor.2006.10.021_bib7","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1080\/095372899232894","article-title":"A new heuristic algorithm for the one-dimensional bin packing problem","volume":"10","author":"Gupta","year":"1999","journal-title":"Production Planning & Control"},{"key":"10.1016\/j.cor.2006.10.021_bib8","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s101070100243","article-title":"New classes of lower bounds for the bin packing problem","volume":"91","author":"Fekete","year":"2001","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.cor.2006.10.021_bib9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1023\/B:HEUR.0000026267.44673.ed","article-title":"A hybrid improvement heuristic for the one-dimensional bin packing problem","volume":"10","author":"Alvim","year":"2004","journal-title":"Journal of Heuristics"},{"key":"10.1016\/j.cor.2006.10.021_bib10","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.physa.2004.10.022","article-title":"Weight annealing","volume":"349","author":"Ninio","year":"2005","journal-title":"Physica A"},{"key":"10.1016\/j.cor.2006.10.021_bib11","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1109\/21.293486","article-title":"Efficient local search with search space smoothing: a case study of the traveling salesman problem","volume":"24","author":"Gu","year":"1994","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"10.1016\/j.cor.2006.10.021_bib12","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1109\/3468.686706","article-title":"See the forest before the trees: fine-tuned learning and its application to the traveling salesman problem","volume":"28","author":"Coy","year":"1998","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"10.1016\/j.cor.2006.10.021_bib13","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90023-A","article-title":"The noising method: a new method for combinatorial optimization","volume":"14","author":"Charon","year":"1993","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.cor.2006.10.021_bib14","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/S0377-2217(98)00099-X","article-title":"Guided local search and its application to the traveling salesman problem","volume":"113","author":"Voudouris","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2006.10.021_bib15","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/ijoc.15.3.267.16080","article-title":"Guided local search for the three-dimensional bin-packing problem","volume":"15","author":"Faroe","year":"2003","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.cor.2006.10.021_bib16","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF00226291","article-title":"A hybrid grouping genetic algorithm for bin packing","volume":"2","author":"Falkenauer","year":"1996","journal-title":"Journal of Heuristics"},{"key":"10.1016\/j.cor.2006.10.021_bib17","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1023\/A:1018952112615","article-title":"Exact solution of bin-packing problems using column generation and branch-and-bound","volume":"86","author":"Carvalho","year":"1999","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.cor.2006.10.021_bib18","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1111\/j.1475-3995.1997.tb00093.x","article-title":"The bin-packing problem: a problem generator and some numerical experiments with FFD packing and MTP","volume":"4","author":"Schwerin","year":"1997","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.cor.2006.10.021_bib19","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01539705","article-title":"Heuristics for the integer one-dimensional cutting stock problem: a computational study","volume":"18","author":"W\u00e4scher","year":"1996","journal-title":"OR Spektrum"},{"key":"10.1016\/j.cor.2006.10.021_bib20","unstructured":"Dongarra J. Performance of various computers using standard linear equations software, Report CS-89-85, Computer Science Department, University of Tennessee, Knoxville, TN; 2006."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054806002826?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054806002826?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T11:24:35Z","timestamp":1556018675000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054806002826"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":20,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["S0305054806002826"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2006.10.021","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[2008,7]]}}}