{"id":"https://openalex.org/W1520087792","doi":"https://doi.org/10.1007/1-4020-8141-3_24","title":"Solving Packing Problem with Weaker Block Solvers","display_name":"Solving Packing Problem with Weaker Block Solvers","publication_year":2006,"publication_date":"2006-02-21","ids":{"openalex":"https://openalex.org/W1520087792","doi":"https://doi.org/10.1007/1-4020-8141-3_24","mag":"1520087792"},"language":"en","primary_location":{"id":"doi:10.1007/1-4020-8141-3_24","is_oa":true,"landing_page_url":"https://doi.org/10.1007/1-4020-8141-3_24","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F1-4020-8141-3_24.pdf","source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007%2F1-4020-8141-3_24.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024666296","display_name":"Hu Zhang","orcid":"https://orcid.org/0000-0002-6894-0926"},"institutions":[{"id":"https://openalex.org/I3133086891","display_name":"Fachhochschule Kiel","ror":"https://ror.org/03q0ab227","country_code":"DE","type":"education","lineage":["https://openalex.org/I3133086891"]},{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Hu Zhang","raw_affiliation_strings":["Institute of Computer Science and Applied Mathematics, University of Kiel, Germany","UNIVERSITY OF KIEL"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science and Applied Mathematics, University of Kiel, Germany","institution_ids":["https://openalex.org/I3133086891"]},{"raw_affiliation_string":"UNIVERSITY OF KIEL","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5024666296"],"corresponding_institution_ids":["https://openalex.org/I3133086891","https://openalex.org/I32021983"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0881794,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"293","last_page":"306"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9997000098228455,"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.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/block","display_name":"Block (permutation group theory)","score":0.766238808631897},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.7619873285293579},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7099563479423523},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.701502799987793},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6374481320381165},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4564308226108551},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39308443665504456},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35191571712493896},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3387971520423889}],"concepts":[{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.766238808631897},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.7619873285293579},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7099563479423523},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.701502799987793},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6374481320381165},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4564308226108551},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39308443665504456},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35191571712493896},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3387971520423889}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/1-4020-8141-3_24","is_oa":true,"landing_page_url":"https://doi.org/10.1007/1-4020-8141-3_24","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F1-4020-8141-3_24.pdf","source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.93.9433","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.9433","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www14.informatik.tu-muenchen.de/konferenzen/WCC2004-TCS/papers/zhang.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1007/1-4020-8141-3_24","is_oa":true,"landing_page_url":"https://doi.org/10.1007/1-4020-8141-3_24","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F1-4020-8141-3_24.pdf","source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1520087792.pdf","grobid_xml":"https://content.openalex.org/works/W1520087792.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W25288802","https://openalex.org/W122708907","https://openalex.org/W330591652","https://openalex.org/W1487188659","https://openalex.org/W1507186339","https://openalex.org/W1508687393","https://openalex.org/W1538948819","https://openalex.org/W1606095651","https://openalex.org/W1607832414","https://openalex.org/W1952648253","https://openalex.org/W1977360022","https://openalex.org/W1992157849","https://openalex.org/W1993161326","https://openalex.org/W1994736182","https://openalex.org/W2002272911","https://openalex.org/W2050328660","https://openalex.org/W2066883826","https://openalex.org/W2097050811","https://openalex.org/W2110526045","https://openalex.org/W2120447465","https://openalex.org/W2134422938","https://openalex.org/W2138260446","https://openalex.org/W2163656645","https://openalex.org/W2165956524","https://openalex.org/W4240034232"],"related_works":["https://openalex.org/W2186864281","https://openalex.org/W4255427455","https://openalex.org/W2962917430","https://openalex.org/W1911700052","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W1496354680","https://openalex.org/W2952847377","https://openalex.org/W2129303870","https://openalex.org/W3214829809"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,22,86,136,153,168,171,197,202],"general":[3,23,87],"packing":[4,24,61,88,203],"problem":[5,25,62,66,89,155,204],"with":[6,33,69,91,95,102,123,156,190,205],"M":[7,179],"constraints.":[8],"In":[9,45,78,182],"[Jansen":[10],"and":[11,40,49,63,116,128,145,163,180],"Zhang,":[12],"TCS":[13],"2002]":[14],"a":[15,54,70],"c":[16,42,75],"(1":[17,55],"+":[18,56],"\u03b5)-approximation":[19,57],"algorithm":[20,58,122,151],"for":[21,59,85,152],"was":[26,67],"proposed.":[27],"A":[28],"block":[29,71,98,193,207],"solver":[30,72],"ABS(bip,\u03b5/6,":[31],"c)":[32,127,162],"price":[34],"vector":[35],"p,":[36],"given":[37],"accuracy":[38],"\u03b5":[39,129,144,159],"ratio":[41],"is":[43,140,175,196],"required.":[44],"addition,":[46],"in":[47,106,142,177],"[Villavicencio":[48],"Grigoriadis,":[50],"Network":[51],"Optimization":[52],"(1997)]":[53],"standard":[60],"its":[64,92],"dual":[65,93,117],"studied,":[68],"ABS(p,O(\u03b5/10)":[73],"(i.e.,":[74],"=":[76],"1).":[77],"this":[79],"paper":[80],"we":[81,119,148],"develop":[82],"c(1+\u03b5)-approximation":[83],"algorithms":[84],"(or":[90],"problem),":[94],"only":[96,178],"weaker":[97,192,206],"solvers":[99],"ABS(p,":[100,125,158],"O(\u03b5\u2032),c)":[101],"same":[103],"structure":[104],"as":[105],"previous":[107],"algorithms,":[108],"where":[109],"\u03b5\u2032":[110],">":[111,131,165],"\u03b5.":[112,132,166,181],"For":[113],"both":[114,183],"primal":[115,154],"problems":[118],"design":[120],"an":[121,124,150,157],"\u03b5/10,":[126],"1":[130],"The":[133],"bound":[134,169],"on":[135,170],"number":[137,172],"of":[138,173],"iterations":[139,174],"polynomial":[141,176],"M,":[143],"c.":[146],"Furthermore":[147],"show":[149],"3":[160],"/6,":[161],"\u03b53":[164],"And":[167],"cases":[184],"running":[185],"times":[186],"are":[187],"further":[188],"improved":[189],"corresponding":[191],"solvers.":[194,208],"This":[195],"first":[198],"attempt":[199],"to":[200],"solve":[201]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}