{"id":"https://openalex.org/W2760293708","doi":"https://doi.org/10.1109/mmar.2017.8046956","title":"Reduction strategies for the Cardinality Constrained Knapsack problem","display_name":"Reduction strategies for the Cardinality Constrained Knapsack problem","publication_year":2017,"publication_date":"2017-08-01","ids":{"openalex":"https://openalex.org/W2760293708","doi":"https://doi.org/10.1109/mmar.2017.8046956","mag":"2760293708"},"language":"en","primary_location":{"id":"doi:10.1109/mmar.2017.8046956","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mmar.2017.8046956","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 22nd International Conference on Methods and Models in Automation and Robotics (MMAR)","raw_type":"proceedings-article"},"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/A5015639192","display_name":"Krzysztof Pie\u0144kosz","orcid":"https://orcid.org/0000-0001-9437-7594"},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Krzysztof Pienkosz","raw_affiliation_strings":["Institute of Control and Computation Engineering, Warsaw University of Technology, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Control and Computation Engineering, Warsaw University of Technology, Warsaw, Poland","institution_ids":["https://openalex.org/I108403487"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5015639192"],"corresponding_institution_ids":["https://openalex.org/I108403487"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"945","last_page":"948"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9994000196456909,"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.9994000196456909,"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.9991999864578247,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9984999895095825,"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.9933476448059082},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.9209278225898743},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.8702610731124878},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6459358334541321},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.6453388333320618},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6443688869476318},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5735860466957092},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.5637574791908264},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5388972163200378},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5083104968070984},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.36179691553115845},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3457271456718445}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9933476448059082},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.9209278225898743},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.8702610731124878},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6459358334541321},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.6453388333320618},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6443688869476318},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5735860466957092},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5637574791908264},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5388972163200378},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5083104968070984},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.36179691553115845},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3457271456718445},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mmar.2017.8046956","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mmar.2017.8046956","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 22nd International Conference on Methods and Models in Automation and Robotics (MMAR)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2031666601","https://openalex.org/W2066671865","https://openalex.org/W2159846562","https://openalex.org/W2910445340","https://openalex.org/W4236127247"],"related_works":["https://openalex.org/W2889442766","https://openalex.org/W2005493932","https://openalex.org/W2381035939","https://openalex.org/W2412614002","https://openalex.org/W2087209118","https://openalex.org/W2122137596","https://openalex.org/W2168163332","https://openalex.org/W2993365626","https://openalex.org/W1969981152","https://openalex.org/W2747091309"],"abstract_inverted_index":{"In":[0],"the":[1,3,15,54,74,87,90],"paper":[2],"Cardinality":[4,66],"Constrained":[5,67],"Knapsack":[6,17,68],"Problem":[7,18,69],"is":[8,11,42,51,70],"considered.":[9],"It":[10],"a":[12,24,39,63],"variant":[13],"of":[14,27,56,77,89],"Continuous":[16],"in":[19,62],"which":[20],"no":[21],"more":[22],"than":[23],"specified":[25],"number":[26,55],"variables":[28],"are":[29],"allowed":[30],"to":[31,85],"have":[32],"positive":[33],"values.":[34],"This":[35],"problem":[36],"arises":[37],"when":[38],"limited":[40],"resource":[41],"allocated":[43],"among":[44],"competing":[45],"activities,":[46],"and":[47,81],"an":[48],"upper":[49],"bound":[50],"imposed":[52],"on":[53],"activities":[57],"that":[58],"can":[59],"be":[60],"selected":[61],"solution.":[64],"The":[65],"NP-hard.":[71],"We":[72],"analyze":[73],"structural":[75],"properties":[76],"its":[78],"optimal":[79],"solutions":[80],"propose":[82],"procedure":[83],"allowing":[84],"reduce":[86],"size":[88],"original":[91],"problem.":[92]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}