乐胖代购免代理版

{"id":"https://openalex.org/W1977189339","doi":"https://doi.org/10.1137/0217002","title":"Analysis of a Hybrid Algorithm for Packing Unequal Bins","display_name":"Analysis of a Hybrid Algorithm for Packing Unequal Bins","publication_year":1988,"publication_date":"1988-02-01","ids":{"openalex":"https://openalex.org/W1977189339","doi":"https://doi.org/10.1137/0217002","mag":"1977189339"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1137/0217002","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059076709","display_name":"Donald K. Friesen","orcid":null},"institutions":[{"id":"https://openalex.org/I44896327","display_name":"Mitre (United States)","ror":"https://ror.org/03ks2a131","country_code":"US","type":"company","lineage":["https://openalex.org/I44896327"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. K. Friesen","raw_affiliation_strings":["The MITRE Corp., McLean, VA,"],"affiliations":[{"raw_affiliation_string":"The MITRE Corp., McLean, VA,","institution_ids":["https://openalex.org/I44896327"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087876659","display_name":"Frederick Kuhl","orcid":null},"institutions":[{"id":"https://openalex.org/I44896327","display_name":"Mitre (United States)","ror":"https://ror.org/03ks2a131","country_code":"US","type":"company","lineage":["https://openalex.org/I44896327"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"F. S. Kuhl","raw_affiliation_strings":["The MITRE Corp., McLean, VA,"],"affiliations":[{"raw_affiliation_string":"The MITRE Corp., McLean, VA,","institution_ids":["https://openalex.org/I44896327"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":10,"citation_normalized_percentile":{"value":0.857653,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":79,"max":80},"biblio":{"volume":"17","issue":"1","first_page":"23","last_page":"40"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9999,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9999,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9969,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9816,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.86745214},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.7010241},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.56752115},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.5316713}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.86745214},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.7010241},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6539211},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5905827},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5846517},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.56752115},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.5316713},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4411684},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36696786},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.33865297},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1137/0217002","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":5,"referenced_works":["https://openalex.org/W1978376940","https://openalex.org/W2012067948","https://openalex.org/W2034640505","https://openalex.org/W2043862089","https://openalex.org/W2068426617"],"related_works":["https://openalex.org/W4288260564","https://openalex.org/W4255148175","https://openalex.org/W3214829809","https://openalex.org/W2797538013","https://openalex.org/W2138242427","https://openalex.org/W2104955674","https://openalex.org/W2068892231","https://openalex.org/W2034272113","https://openalex.org/W2026961896","https://openalex.org/W173368591"],"abstract_inverted_index":{"We":[0,31,109,135],"consider":[1],"a":[2,33,40,138],"bin-packing":[3],"problem":[4,28,116],"where":[5,16,118],"the":[6,9,17,22,82,87,101,115,127,131,144,147],"sizes":[7],"of":[8,24,42,66,69,90,104,114,129,140,146,149],"bins":[10],"are":[11],"allowed":[12],"to":[13,20,60,159],"vary":[14],"and":[15,50,63,92,98,153],"goal":[18],"is":[19,29,39,56],"maximize":[21],"number":[23,128,148],"pieces":[25,70,91,130,150],"packed.":[26],"This":[27],"NP-hard.":[30],"examine":[32],"new":[34],"efficient":[35],"approximation":[36],"algorithm":[37,121,156],"which":[38,143],"hybrid":[41,55,83,132],"two":[43],"algorithms":[44],"reported":[45],"earlier,":[46],"First-Fit":[47],"Decreasing":[48],"(FFD)":[49],"Best-Two":[51],"Fit":[52],"(B2F).":[53],"The":[54],"iterative:":[57],"it":[58,72],"attempts":[59],"pack":[61,123],"smaller":[62,64],"suffixes":[65],"its":[67,105],"list":[68,89,106],"until":[71],"succeeds":[73],"in":[74],"packing":[75,93,100],"an":[76,119],"entire":[77],"suffix.":[78],"During":[79],"each":[80],"attempt,":[81],"operates":[84],"by":[85,96,107,154],"partitioning":[86],"current":[88],"one":[94],"part":[95,103],"B2F":[97],"afterward":[99],"other":[102],"FFD.":[108],"prove":[110],"that":[111],"no":[112],"instance":[113],"exists":[117],"optimal":[120],"can":[122,133],"more":[124],"than":[125],"$\\tfrac{4}{3}$":[126],"pack.":[134],"also":[136],"give":[137],"sequence":[139],"examples":[141],"for":[142],"ratio":[145],"packed":[151],"optimally":[152],"our":[155],"increases":[157],"asymptotically":[158],"$\\frac{4}{3}$.":[160]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1977189339","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-02-16T02:20:51.527929","created_date":"2016-06-24"}