{"id":"https://openalex.org/W1701984136","doi":"https://doi.org/10.1007/3-540-44634-6_20","title":"Approximating Multi-objective Knapsack Problems","display_name":"Approximating Multi-objective Knapsack Problems","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1701984136","doi":"https://doi.org/10.1007/3-540-44634-6_20","mag":"1701984136"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44634-6_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44634-6_20","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5049579750","display_name":"Thomas Erlebach","orcid":"https://orcid.org/0000-0002-4470-5868"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Thomas Erlebach","raw_affiliation_strings":["Computer Engineering and Networks Laboratory, ETH Z\u00fcrich, CH-8092, Z\u00fcrich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Engineering and Networks Laboratory, ETH Z\u00fcrich, CH-8092, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079478965","display_name":"Hans Kellerer","orcid":"https://orcid.org/0000-0001-7618-3956"},"institutions":[{"id":"https://openalex.org/I15766117","display_name":"University of Graz","ror":"https://ror.org/01faaaf77","country_code":"AT","type":"education","lineage":["https://openalex.org/I15766117"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Hans Kellerer","raw_affiliation_strings":["Department of Statistics and Operations Research, University of Graz, Universit\u00e4tsstr. 15, A-8010, Graz, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Statistics and Operations Research, University of Graz, Universit\u00e4tsstr. 15, A-8010, Graz, Austria","institution_ids":["https://openalex.org/I15766117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069744603","display_name":"Ulrich Pferschy","orcid":"https://orcid.org/0000-0001-8881-1497"},"institutions":[{"id":"https://openalex.org/I15766117","display_name":"University of Graz","ror":"https://ror.org/01faaaf77","country_code":"AT","type":"education","lineage":["https://openalex.org/I15766117"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Ulrich Pferschy","raw_affiliation_strings":["Department of Statistics and Operations Research, University of Graz, Universit\u00e4tsstr. 15, A-8010, Graz, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Statistics and Operations Research, University of Graz, Universit\u00e4tsstr. 15, A-8010, Graz, Austria","institution_ids":["https://openalex.org/I15766117"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"210","last_page":"221"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9990000128746033,"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/T12176","display_name":"Optimization and Packing Problems","score":0.996999979019165,"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.9951000213623047,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9843180179595947},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.904133677482605},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.8498910069465637},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6915650963783264},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.48967722058296204},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4813602566719055},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.48073339462280273},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46985211968421936},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4504552483558655},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4442902207374573},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.4348643720149994},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.42076346278190613},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3594188094139099},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.13796097040176392}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9843180179595947},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.904133677482605},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.8498910069465637},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6915650963783264},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.48967722058296204},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4813602566719055},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.48073339462280273},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46985211968421936},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4504552483558655},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4442902207374573},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.4348643720149994},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.42076346278190613},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3594188094139099},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13796097040176392},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-44634-6_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44634-6_20","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1524700731","https://openalex.org/W1542883217","https://openalex.org/W1590926391","https://openalex.org/W1928381443","https://openalex.org/W1966986652","https://openalex.org/W2038022125","https://openalex.org/W2055037276","https://openalex.org/W2067500652","https://openalex.org/W2081136687","https://openalex.org/W2106334424","https://openalex.org/W2132058842","https://openalex.org/W4292542951"],"related_works":["https://openalex.org/W2087209118","https://openalex.org/W2993365626","https://openalex.org/W179363847","https://openalex.org/W2020081923","https://openalex.org/W2041040939","https://openalex.org/W2122137596","https://openalex.org/W4312871059","https://openalex.org/W3202092202","https://openalex.org/W3171554204","https://openalex.org/W4281741337"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}