{"id":"https://openalex.org/W2901266587","doi":"https://doi.org/10.1109/tsmc.2018.2882792","title":"Canonical Duality Theory and Algorithm for Solving Bilevel Knapsack Problems With Applications","display_name":"Canonical Duality Theory and Algorithm for Solving Bilevel Knapsack Problems With Applications","publication_year":2018,"publication_date":"2018-12-27","ids":{"openalex":"https://openalex.org/W2901266587","doi":"https://doi.org/10.1109/tsmc.2018.2882792","mag":"2901266587"},"language":"en","primary_location":{"id":"doi:10.1109/tsmc.2018.2882792","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsmc.2018.2882792","pdf_url":null,"source":{"id":"https://openalex.org/S4210209078","display_name":"IEEE Transactions on Systems Man and Cybernetics Systems","issn_l":"2168-2216","issn":["2168-2216","2168-2232"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Systems, Man, and Cybernetics: Systems","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1811.10130","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"David Yang Gao","orcid":"https://orcid.org/0000-0002-2245-8050"},"institutions":[{"id":"https://openalex.org/I149672521","display_name":"Federation University","ror":"https://ror.org/05qbzwv83","country_code":"AU","type":"education","lineage":["https://openalex.org/I149672521"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"David Yang Gao","raw_affiliation_strings":["School of Science and Information Technology, Federation University Australia, Mount Helen, VIC, Australia"],"affiliations":[{"raw_affiliation_string":"School of Science and Information Technology, Federation University Australia, Mount Helen, VIC, Australia","institution_ids":["https://openalex.org/I149672521"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I149672521"],"apc_list":null,"apc_paid":null,"fwci":0.6826,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.69392469,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"51","issue":"2","first_page":"893","last_page":"904"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.47940000891685486,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.47940000891685486,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.2556000053882599,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.1152999997138977,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9458000063896179},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5827999711036682},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.5026999711990356},{"id":"https://openalex.org/keywords/uniqueness","display_name":"Uniqueness","score":0.4607999920845032},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.4415000081062317},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4309000074863434},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.412200003862381},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.3684000074863434},{"id":"https://openalex.org/keywords/bilevel-optimization","display_name":"Bilevel optimization","score":0.3653999865055084}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9458000063896179},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.762499988079071},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5827999711036682},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5232999920845032},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5026999711990356},{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.4607999920845032},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.4415000081062317},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4309000074863434},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.412200003862381},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37869998812675476},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3684000074863434},{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.3653999865055084},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.35339999198913574},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3431999981403351},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.3165000081062317},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.30640000104904175},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.29899999499320984},{"id":"https://openalex.org/C5274546","wikidata":"https://www.wikidata.org/wiki/Q5310264","display_name":"Duality gap","level":3,"score":0.29600000381469727},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.29409998655319214},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.2906999886035919},{"id":"https://openalex.org/C204707403","wikidata":"https://www.wikidata.org/wiki/Q1152398","display_name":"Canonical form","level":2,"score":0.27379998564720154},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C177179195","wikidata":"https://www.wikidata.org/wiki/Q7268372","display_name":"Quadratic unconstrained binary optimization","level":4,"score":0.26260000467300415},{"id":"https://openalex.org/C163863214","wikidata":"https://www.wikidata.org/wiki/Q7624553","display_name":"Strong duality","level":3,"score":0.2623000144958496},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2587999999523163}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tsmc.2018.2882792","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsmc.2018.2882792","pdf_url":null,"source":{"id":"https://openalex.org/S4210209078","display_name":"IEEE Transactions on Systems Man and Cybernetics Systems","issn_l":"2168-2216","issn":["2168-2216","2168-2232"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Systems, Man, and Cybernetics: Systems","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1811.10130","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1811.10130","pdf_url":"https://arxiv.org/pdf/1811.10130","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:vital:15006","is_oa":false,"landing_page_url":"http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/175581","pdf_url":null,"source":{"id":"https://openalex.org/S4306400234","display_name":"FedUni ResearchOnline (Federation University Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210158496","host_organization_name":"Australian Federation of University Women \u2013 South Australia","host_organization_lineage":["https://openalex.org/I4210158496"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1811.10130","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1811.10130","pdf_url":"https://arxiv.org/pdf/1811.10130","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2200650393","display_name":null,"funder_award_id":"FA2386-16-1-4082","funder_id":"https://openalex.org/F4320332467","funder_display_name":"U.S. Air Force"},{"id":"https://openalex.org/G4604304450","display_name":null,"funder_award_id":"FA9550-17-1-0151","funder_id":"https://openalex.org/F4320332467","funder_display_name":"U.S. Air Force"},{"id":"https://openalex.org/G7090116110","display_name":null,"funder_award_id":"FA9550","funder_id":"https://openalex.org/F4320332467","funder_display_name":"U.S. Air Force"}],"funders":[{"id":"https://openalex.org/F4320320970","display_name":"Deakin University","ror":"https://ror.org/02czsnj07"},{"id":"https://openalex.org/F4320332467","display_name":"U.S. Air Force","ror":"https://ror.org/006gmme17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W8102976","https://openalex.org/W333643410","https://openalex.org/W583033002","https://openalex.org/W1508674681","https://openalex.org/W1509288136","https://openalex.org/W1669378206","https://openalex.org/W1839515685","https://openalex.org/W1965908168","https://openalex.org/W1968142821","https://openalex.org/W1972604104","https://openalex.org/W1983775864","https://openalex.org/W1995153978","https://openalex.org/W2000976787","https://openalex.org/W2005629858","https://openalex.org/W2010701510","https://openalex.org/W2015571103","https://openalex.org/W2046355282","https://openalex.org/W2046432398","https://openalex.org/W2046866303","https://openalex.org/W2053770324","https://openalex.org/W2065534296","https://openalex.org/W2067509362","https://openalex.org/W2076930378","https://openalex.org/W2079104779","https://openalex.org/W2090295928","https://openalex.org/W2091531873","https://openalex.org/W2135702200","https://openalex.org/W2140040410","https://openalex.org/W2163194391","https://openalex.org/W2167925113","https://openalex.org/W2168217992","https://openalex.org/W2254218369","https://openalex.org/W2259507927","https://openalex.org/W2291204103","https://openalex.org/W2326664437","https://openalex.org/W2329255878","https://openalex.org/W2401610261","https://openalex.org/W2481910659","https://openalex.org/W2490295271","https://openalex.org/W2519665767","https://openalex.org/W2534621704","https://openalex.org/W2583644423","https://openalex.org/W2763342970","https://openalex.org/W2763513969","https://openalex.org/W2771965099","https://openalex.org/W2789594263","https://openalex.org/W2797873665","https://openalex.org/W4236066961","https://openalex.org/W4236127247","https://openalex.org/W4255624529","https://openalex.org/W6633903886","https://openalex.org/W6635298591","https://openalex.org/W6635862605"],"related_works":[],"abstract_inverted_index":{"A":[0,58],"novel":[1],"canonical":[2,38],"duality":[3],"theory":[4],"(CDT)":[5],"is":[6,56,72,82],"presented":[7],"for":[8,74],"solving":[9,75],"general":[10],"bilevel":[11,78],"mixed":[12],"integer":[13],"nonlinear":[14],"optimization":[15],"governed":[16],"by":[17,84],"linear":[18],"and":[19,43,67,93],"quadratic":[20],"knapsack":[21,28,54,79],"problems.":[22,80],"It":[23],"shows":[24],"that":[25],"the":[26,53,76,96,102],"challenging":[27],"problems":[29,55,86],"can":[30],"be":[31],"solved":[32],"analytically":[33],"in":[34,87],"term":[35],"of":[36,45,52,95],"their":[37],"dual":[39],"solutions.":[40],"The":[41,91],"existence":[42],"uniqueness":[44],"these":[46],"analytical":[47],"solutions":[48],"are":[49,99],"proved.":[50],"NP-hardness":[51],"discussed.":[57],"powerful":[59],"CDT":[60],"algorithm":[61],"combined":[62],"with":[63,101],"an":[64],"alternative":[65],"iteration":[66],"a":[68],"volume":[69],"reduction":[70],"method":[71,98],"proposed":[73,97],"NP-hard":[77],"Application":[81],"illustrated":[83],"benchmark":[85],"optimal":[88],"topology":[89],"design.":[90],"performance":[92],"novelty":[94],"compared":[100],"popular":[103],"commercial":[104],"codes.":[105]},"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2018-11-29T00:00:00"}