{"id":"https://openalex.org/W2170685064","doi":"https://doi.org/10.1109/icsmc.2009.5346276","title":"A novel quantum evolutionary algorithm for quadratic Knapsack problem","display_name":"A novel quantum evolutionary algorithm for quadratic Knapsack problem","publication_year":2009,"publication_date":"2009-10-01","ids":{"openalex":"https://openalex.org/W2170685064","doi":"https://doi.org/10.1109/icsmc.2009.5346276","mag":"2170685064"},"language":"en","primary_location":{"id":"doi:10.1109/icsmc.2009.5346276","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2009.5346276","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Systems, Man and Cybernetics","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":"https://openalex.org/A5000267964","display_name":"Apurva Narayan","orcid":"https://orcid.org/0000-0001-7203-8698"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Apurva Narayan","raw_affiliation_strings":["Schlumberger Oil Field Services, Pune, India"],"affiliations":[{"raw_affiliation_string":"Schlumberger Oil Field Services, Pune, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072764860","display_name":"C. Patvardhan","orcid":null},"institutions":[{"id":"https://openalex.org/I178254495","display_name":"Dayalbagh Educational Institute","ror":"https://ror.org/04q4j2f69","country_code":"IN","type":"education","lineage":["https://openalex.org/I178254495"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"C. Patvardhan","raw_affiliation_strings":["Department of Electrical Engineering, Dayalbagh Educational Institute (Deemed University), Agra, India"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Dayalbagh Educational Institute (Deemed University), Agra, India","institution_ids":["https://openalex.org/I178254495"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000267964"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3086,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.85474518,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1388","last_page":"1392"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9966999888420105,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9752923250198364},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.8670742511749268},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.5985333323478699},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5460730195045471},{"id":"https://openalex.org/keywords/quadratic-unconstrained-binary-optimization","display_name":"Quadratic unconstrained binary optimization","score":0.5174708962440491},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5105706453323364},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5080304145812988},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5051942467689514},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.4876162111759186},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.47114697098731995},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4646346867084503},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.45361921191215515},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.44439569115638733},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4333043396472931},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4318240284919739},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.41771864891052246},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.401273250579834},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.394370436668396},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38335293531417847},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.32891666889190674},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2931981086730957},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24847203493118286}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9752923250198364},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.8670742511749268},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.5985333323478699},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5460730195045471},{"id":"https://openalex.org/C177179195","wikidata":"https://www.wikidata.org/wiki/Q7268372","display_name":"Quadratic unconstrained binary optimization","level":4,"score":0.5174708962440491},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5105706453323364},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5080304145812988},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5051942467689514},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.4876162111759186},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.47114697098731995},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4646346867084503},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.45361921191215515},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.44439569115638733},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4333043396472931},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4318240284919739},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.41771864891052246},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.401273250579834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.394370436668396},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38335293531417847},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.32891666889190674},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2931981086730957},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24847203493118286},{"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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icsmc.2009.5346276","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2009.5346276","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Systems, Man and Cybernetics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1509288136","https://openalex.org/W1563298345","https://openalex.org/W1669378206","https://openalex.org/W1970801029","https://openalex.org/W2026973340","https://openalex.org/W2029859833","https://openalex.org/W2091971915","https://openalex.org/W2093716880","https://openalex.org/W2122274805","https://openalex.org/W2137023518","https://openalex.org/W2148132004","https://openalex.org/W2159203416","https://openalex.org/W2165102583","https://openalex.org/W2250294758","https://openalex.org/W2401096565"],"related_works":["https://openalex.org/W2889442766","https://openalex.org/W2122137596","https://openalex.org/W3169691842","https://openalex.org/W3166857172","https://openalex.org/W2381035939","https://openalex.org/W2412614002","https://openalex.org/W2024427769","https://openalex.org/W2168163332","https://openalex.org/W4288642040","https://openalex.org/W2087209118"],"abstract_inverted_index":{"The":[0],"Quadratic":[1],"Knapsack":[2],"Problem":[3],"(QKP)":[4],"deals":[5],"with":[6],"maximizing":[7],"a":[8,44,47,57],"quadratic":[9],"objective":[10],"function":[11],"subject":[12],"to":[13,26,32,36,103,116],"given":[14,50],"constraints":[15],"on":[16],"the":[17,20,39,92,113],"capacity":[18],"of":[19,41,49,77,91,111],"Knapsack.":[21],"We":[22,52,79,95],"assume":[23],"all":[24,30],"coefficients":[25],"be":[27,33,72],"non-negative":[28],"and":[29,70,108],"variables":[31],"binary.":[34],"Solution":[35],"QKP":[37],"generalizes":[38],"problem":[40,106],"finding":[42],"whether":[43],"graph":[45],"contains":[46],"clique":[48],"size.":[51],"propose":[53],"in":[54,81,87],"this":[55,82],"paper":[56,83],"Novel":[58],"Quantum":[59],"Evolutionary":[60],"Algorithm":[61],"(NQEA)":[62],"for":[63,74],"QKPs.":[64],"These":[65],"algorithms":[66],"are":[67],"general":[68],"enough":[69],"can":[71],"used":[73],"similar":[75],"subsection":[76],"problems.":[78],"report":[80],"solutions":[84],"which":[85],"lie":[86],"less":[88],"than":[89],"1%":[90],"optimal":[93],"solutions.":[94],"also":[96],"show":[97],"that":[98],"our":[99],"algorithm":[100],"is":[101,109],"scalable":[102],"much":[104],"larger":[105],"sizes":[107],"capable":[110],"exploiting":[112],"search":[114],"space":[115],"its":[117],"maximum.":[118]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-01-13T01:12:25.745995","created_date":"2025-10-10T00:00:00"}