{"id":"https://openalex.org/W2082718338","doi":"https://doi.org/10.1016/s0166-218x(96)00134-5","title":"Simple but efficient approaches for the collapsing knapsack problem","display_name":"Simple but efficient approaches for the collapsing knapsack problem","publication_year":1997,"publication_date":"1997-08-01","ids":{"openalex":"https://openalex.org/W2082718338","doi":"https://doi.org/10.1016/s0166-218x(96)00134-5","mag":"2082718338"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(96)00134-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(96)00134-5","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"type":"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/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":true,"raw_author_name":"Ulrich Pferschy","raw_affiliation_strings":["Universit\u00e4t Graz, Institut f\u00fcr Statistik und Operations Research, Universit\u00e4tsstv. 15, A-8010 Graz, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Graz, Institut f\u00fcr Statistik und Operations Research, Universit\u00e4tsstv. 15, A-8010 Graz, Austria","institution_ids":["https://openalex.org/I15766117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081910021","display_name":"David Pisinger","orcid":"https://orcid.org/0000-0001-7695-9662"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"David Pisinger","raw_affiliation_strings":["DIKU, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DIKU, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080746477","display_name":"Gerhard J. Woeginger","orcid":"https://orcid.org/0000-0001-8816-2693"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Gerhard J. Woeginger","raw_affiliation_strings":["TU Graz, Institut f\u00fcr Mathematik B, Steyrergasse 30, A-8010 Graz, Austria","TU Graz, Institut f\u00fcr Mathematik B, Steyrergasse 30, A\u20108010 Graz, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Graz, Institut f\u00fcr Mathematik B, Steyrergasse 30, A-8010 Graz, Austria","institution_ids":["https://openalex.org/I4092182"]},{"raw_affiliation_string":"TU Graz, Institut f\u00fcr Mathematik B, Steyrergasse 30, A\u20108010 Graz, Austria","institution_ids":["https://openalex.org/I4092182"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5069744603"],"corresponding_institution_ids":["https://openalex.org/I15766117"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":5.2739,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.95121585,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"77","issue":"3","first_page":"271","last_page":"280"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9904999732971191,"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"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9842000007629395,"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.9892706274986267},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.8853744864463806},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.7580438852310181},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.7374976277351379},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7354516983032227},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6710467338562012},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.6348696947097778},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6089544892311096},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.511053204536438},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.48432624340057373},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4786490201950073},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.467816561460495},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.454474538564682},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4455717206001282},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.323830783367157},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.23343318700790405}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9892706274986267},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.8853744864463806},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.7580438852310181},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.7374976277351379},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7354516983032227},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6710467338562012},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.6348696947097778},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6089544892311096},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.511053204536438},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.48432624340057373},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4786490201950073},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.467816561460495},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.454474538564682},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4455717206001282},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.323830783367157},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.23343318700790405},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1016/s0166-218x(96)00134-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(96)00134-5","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:publications/f94198b9-6525-4279-b99d-17e8e8318ede","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/f94198b9-6525-4279-b99d-17e8e8318ede","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pferschy, U, Pisinger, D & Woeginger, G J 1997, 'Simple but efficient approaches for the collapsing knapsack problem', Discrete Applied Mathematics, vol. 77, no. 3, pp. 271-280. https://doi.org/10.1016/S0166-218X(96)00134-5","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:680491","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=680491","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0166-218X","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:680491","is_oa":false,"landing_page_url":"http://repository.tue.nl/680491","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0166-218X","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/0c3e6380-74cb-11db-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://curis.ku.dk/portal/da/publications/simple-but-efficient-approaches-for-the-collapsing-knapsack-problem(0c3e6380-74cb-11db-bee9-02004c4f4f50).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Pferschy , U , Pisinger , D & Woeginger , G 1997 , ' Simple but Efficient Approaches for the Collapsing Knapsack Problem ' , Discrete Applied Mathematics , no. Vol. 77 , pp. 271-280 .","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/0c3e6380-74cb-11db-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/0c3e6380-74cb-11db-bee9-02004c4f4f50","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Pferschy , U , Pisinger , D & Woeginger , G 1997 , ' Simple but Efficient Approaches for the Collapsing Knapsack Problem ' , Discrete Applied Mathematics , no. Vol. 77 , pp. 271-280 .","raw_type":"article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/f94198b9-6525-4279-b99d-17e8e8318ede","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/f94198b9-6525-4279-b99d-17e8e8318ede","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete Applied Mathematics, 77(3), 271 - 280. Elsevier","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1966693694","https://openalex.org/W1981434190","https://openalex.org/W2017316844","https://openalex.org/W2022526624","https://openalex.org/W2022879050","https://openalex.org/W2086168649","https://openalex.org/W2130350796","https://openalex.org/W6641753929","https://openalex.org/W6679482593"],"related_works":["https://openalex.org/W2889442766","https://openalex.org/W2412614002","https://openalex.org/W2005493932","https://openalex.org/W2381035939","https://openalex.org/W2087209118","https://openalex.org/W4249611560","https://openalex.org/W2122137596","https://openalex.org/W2168163332","https://openalex.org/W2993365626","https://openalex.org/W4256002267"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}