{"id":"https://openalex.org/W2396030090","doi":"https://doi.org/10.1109/icnsc.2016.7478998","title":"A new fast reduction algorithm for binary knapsack problem","display_name":"A new fast reduction algorithm for binary knapsack problem","publication_year":2016,"publication_date":"2016-04-01","ids":{"openalex":"https://openalex.org/W2396030090","doi":"https://doi.org/10.1109/icnsc.2016.7478998","mag":"2396030090"},"language":"en","primary_location":{"id":"doi:10.1109/icnsc.2016.7478998","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnsc.2016.7478998","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 13th International Conference on Networking, Sensing, and Control (ICNSC)","raw_type":"proceedings-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":null,"display_name":"Xiaohua Xiong","orcid":null},"institutions":[{"id":"https://openalex.org/I135905480","display_name":"Shanghai Polytechnic University","ror":"https://ror.org/02as5yg64","country_code":"CN","type":"education","lineage":["https://openalex.org/I135905480"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xiaohua Xiong","raw_affiliation_strings":["Dept. of Electronics & Information Technology, Shanghai Polytechnic University, Shanghai, China"],"affiliations":[{"raw_affiliation_string":"Dept. of Electronics & Information Technology, Shanghai Polytechnic University, Shanghai, China","institution_ids":["https://openalex.org/I135905480"]}]},{"author_position":"last","author":{"id":null,"display_name":"Aibing Ning","orcid":null},"institutions":[{"id":"https://openalex.org/I148128674","display_name":"University of Shanghai for Science and Technology","ror":"https://ror.org/00ay9v204","country_code":"CN","type":"education","lineage":["https://openalex.org/I148128674"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Aibing Ning","raw_affiliation_strings":["School of Management, University of Shanghai for Science and Technology, Shanghai, China"],"affiliations":[{"raw_affiliation_string":"School of Management, University of Shanghai for Science and Technology, Shanghai, China","institution_ids":["https://openalex.org/I148128674"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I135905480"],"apc_list":null,"apc_paid":null,"fwci":0.4246,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.68813386,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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.9998999834060669,"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.9983999729156494,"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.9980000257492065,"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/knapsack-problem","display_name":"Knapsack problem","score":0.9904980659484863},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.7348929643630981},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.7303525805473328},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6856498122215271},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6672285795211792},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.5730464458465576},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5712394714355469},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5575392246246338},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5098282694816589},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.4753691554069519},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.4117392599582672},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3905055820941925},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3510759770870209},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.2193518877029419},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08935350179672241},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.06250962615013123}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9904980659484863},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.7348929643630981},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.7303525805473328},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6856498122215271},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6672285795211792},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.5730464458465576},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5712394714355469},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5575392246246338},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5098282694816589},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.4753691554069519},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.4117392599582672},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3905055820941925},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3510759770870209},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2193518877029419},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08935350179672241},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.06250962615013123},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnsc.2016.7478998","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnsc.2016.7478998","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 13th International Conference on Networking, Sensing, and Control (ICNSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320329022","display_name":"Shanghai Polytechnic University","ror":"https://ror.org/02as5yg64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W254944847","https://openalex.org/W1492845317","https://openalex.org/W1530657679","https://openalex.org/W1776713878","https://openalex.org/W1972746086","https://openalex.org/W1975033706","https://openalex.org/W2017316844","https://openalex.org/W2037698864","https://openalex.org/W2045625203","https://openalex.org/W2051225371","https://openalex.org/W2056380589","https://openalex.org/W2060322444","https://openalex.org/W2066671865","https://openalex.org/W2104836429","https://openalex.org/W2127172809","https://openalex.org/W2912136832","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/W2993365626","https://openalex.org/W1969981152","https://openalex.org/W2747091309","https://openalex.org/W2089402478"],"abstract_inverted_index":{"The":[0],"first":[1],"reduction":[2,61],"algorithm":[3,19,43,62],"for":[4,63,80],"binary":[5,64,81],"knapsack":[6,65,82],"problems":[7],"was":[8],"developed":[9],"by":[10,27],"Ingargiola":[11],"and":[12,92],"Korsh":[13],"(1973).":[14],"It":[15],"is":[16,44],"a":[17,59],"preprocessing":[18],"which":[20,67],"significantly":[21],"reduces":[22],"the":[23,29,39,42,88,93],"number":[24],"of":[25,32,41],"variables":[26,35,71],"fixing":[28],"optimal":[30],"value":[31],"as":[33,36],"many":[34],"possible.":[37],"However,":[38],"speed":[40],"pretty":[45],"slow,":[46],"because":[47],"it":[48,84],"only":[49],"fixes":[50],"one":[51,54,73],"variable":[52],"at":[53,72],"time.":[55,74],"This":[56],"paper":[57],"presents":[58],"new":[60],"problem":[66],"can":[68,85],"fix":[69],"several":[70],"When":[75],"combined":[76],"with":[77],"available":[78],"algorithms":[79],"problems,":[83],"substantially":[86],"reduce":[87],"total":[89],"running":[90],"time":[91],"space":[94],"requirements.":[95]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}