{"id":"https://openalex.org/W2373537127","doi":"https://doi.org/10.1145/2828635","title":"An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem","display_name":"An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem","publication_year":2016,"publication_date":"2016-05-10","ids":{"openalex":"https://openalex.org/W2373537127","doi":"https://doi.org/10.1145/2828635","mag":"2373537127"},"language":"en","primary_location":{"id":"doi:10.1145/2828635","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2828635","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2828635?download=true","source":{"id":"https://openalex.org/S163326656","display_name":"ACM Transactions on Mathematical Software","issn_l":"0098-3500","issn":["0098-3500","1557-7295"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Mathematical Software","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2828635?download=true","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069178025","display_name":"Timothy A. Davis","orcid":"https://orcid.org/0000-0001-7614-6899"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Timothy A. Davis","raw_affiliation_strings":["Texas A&M University, TX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Texas A&M University, TX","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002362913","display_name":"William W. Hager","orcid":"https://orcid.org/0000-0003-3132-7017"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"William W. Hager","raw_affiliation_strings":["University of Florida, Gainesville, FL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Florida, Gainesville, FL","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077032007","display_name":"James T. Hungerford","orcid":"https://orcid.org/0000-0002-9898-4911"},"institutions":[{"id":"https://openalex.org/I127077003","display_name":"IMT School for Advanced Studies Lucca","ror":"https://ror.org/035gh3a49","country_code":"IT","type":"education","lineage":["https://openalex.org/I127077003"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"James T. Hungerford","raw_affiliation_strings":["M.A.I.O.R., Lucca, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"M.A.I.O.R., Lucca, Italy","institution_ids":["https://openalex.org/I127077003"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.224,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.90885364,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"42","issue":"3","first_page":"1","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9991000294685364,"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.9991000294685364,"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.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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9728000164031982,"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/mathematics","display_name":"Mathematics","score":0.6429048776626587},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5182930827140808},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4947151839733124},{"id":"https://openalex.org/keywords/hessian-matrix","display_name":"Hessian matrix","score":0.4601922333240509},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4403115510940552},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.43829819560050964},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.4331371486186981},{"id":"https://openalex.org/keywords/lagrange-multiplier","display_name":"Lagrange multiplier","score":0.41514822840690613},{"id":"https://openalex.org/keywords/root-finding-algorithm","display_name":"Root-finding algorithm","score":0.4139980971813202},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.14959856867790222}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6429048776626587},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5182930827140808},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4947151839733124},{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.4601922333240509},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4403115510940552},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.43829819560050964},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.4331371486186981},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.41514822840690613},{"id":"https://openalex.org/C194777461","wikidata":"https://www.wikidata.org/wiki/Q1085860","display_name":"Root-finding algorithm","level":3,"score":0.4139980971813202},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.14959856867790222},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2828635","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2828635","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2828635?download=true","source":{"id":"https://openalex.org/S163326656","display_name":"ACM Transactions on Mathematical Software","issn_l":"0098-3500","issn":["0098-3500","1557-7295"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Mathematical Software","raw_type":"journal-article"},{"id":"pmh:oai:zenodo.org:169850","is_oa":true,"landing_page_url":"https://www.openaccessrepository.it/record/169850","pdf_url":null,"source":{"id":"https://openalex.org/S4306402478","display_name":"INFM-OAR (INFN Catania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210116497","host_organization_name":"Istituto Nazionale di Fisica Nucleare, Sezione di Catania","host_organization_lineage":["https://openalex.org/I4210116497"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1145/2828635","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2828635","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2828635?download=true","source":{"id":"https://openalex.org/S163326656","display_name":"ACM Transactions on Mathematical Software","issn_l":"0098-3500","issn":["0098-3500","1557-7295"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Mathematical Software","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.6200000047683716}],"awards":[{"id":"https://openalex.org/G2193832229","display_name":null,"funder_award_id":"N00014-15-1-2048","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G2378547780","display_name":null,"funder_award_id":"N00014-11-1-0068","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G3509903425","display_name":"Fast Sparse Nonlinear Optimization and Its Application to Optimal Control","funder_award_id":"1522629","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4163190780","display_name":null,"funder_award_id":"N00014-11-1-0068, N00014-15-1-2048","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G6050504816","display_name":null,"funder_award_id":"HR0011-12-C-0011","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G8681003497","display_name":"MSPA-ENG: Scalable Sparse Matrix Algorithms and Software for Nonlinear Optimization","funder_award_id":"0620286","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306078","display_name":"U.S. Department of Defense","ror":"https://ror.org/0447fe631"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2373537127.pdf","grobid_xml":"https://content.openalex.org/works/W2373537127.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W18706009","https://openalex.org/W1507039213","https://openalex.org/W1938617527","https://openalex.org/W1972029377","https://openalex.org/W1978119584","https://openalex.org/W1984187882","https://openalex.org/W1987755233","https://openalex.org/W1991907403","https://openalex.org/W2000985550","https://openalex.org/W2015263936","https://openalex.org/W2018984203","https://openalex.org/W2024574812","https://openalex.org/W2031586484","https://openalex.org/W2034027023","https://openalex.org/W2046881509","https://openalex.org/W2051296280","https://openalex.org/W2056385679","https://openalex.org/W2061211758","https://openalex.org/W2061274033","https://openalex.org/W2062677144","https://openalex.org/W2063060116","https://openalex.org/W2066921519","https://openalex.org/W2069958114","https://openalex.org/W2086079401","https://openalex.org/W2116775748","https://openalex.org/W2119766865","https://openalex.org/W2143277915","https://openalex.org/W2151898625","https://openalex.org/W2266946488","https://openalex.org/W3145128584","https://openalex.org/W3148864501","https://openalex.org/W4211092921","https://openalex.org/W4249667877","https://openalex.org/W4291236916"],"related_works":["https://openalex.org/W1983350378","https://openalex.org/W2044296933","https://openalex.org/W3105202832","https://openalex.org/W3104759054","https://openalex.org/W640868337","https://openalex.org/W2970432723","https://openalex.org/W2362837015","https://openalex.org/W2972343833","https://openalex.org/W1560140409","https://openalex.org/W2996136316"],"abstract_inverted_index":{"This":[0],"article":[1],"considers":[2],"the":[3,35,43,49,53,56,64,72,81,90,94,99,102,110,121,170],"problem":[4],"of":[5,55,83,93,101,109],"minimizing":[6],"a":[7,14,18,39,84,106,135,148,152,162],"convex,":[8],"separable":[9],"quadratic":[10],"function":[11,96],"subject":[12],"to":[13,28,42,146],"knapsack":[15],"constraint":[16],"and":[17,47,97],"box":[19],"constraint.":[20],"An":[21],"algorithm":[22,33,79,113,131],"called":[23],"NAPHEAP":[24,132],"has":[25],"been":[26],"developed":[27,115],"solve":[29],"this":[30],"problem.":[31,104],"The":[32,58,129],"solves":[34],"Karush-Kuhn-Tucker":[36],"system":[37],"using":[38,63],"starting":[40,59],"guess":[41,50,60],"optimal":[44],"Lagrange":[45],"multiplier":[46],"updating":[48],"monotonically":[51],"in":[52,77,169],"direction":[54],"solution.":[57],"is":[61,69,80,114,117,124],"computed":[62],"variable":[65,111],"fixing":[66,112,139],"method":[67,137,164],"or":[68,143],"supplied":[70],"by":[71,151,165],"user.":[73],"A":[74],"key":[75],"innovation":[76],"our":[78],"implementation":[82],"heap":[85],"data":[86],"structure":[87],"for":[88],"storing":[89],"break":[91,155],"points":[92],"dual":[95,103],"computing":[98],"solution":[100],"Also,":[105],"new":[107],"version":[108],"that":[116,133],"convergent":[118],"even":[119],"when":[120],"objective":[122],"Hessian":[123],"not":[125],"strictly":[126],"positive":[127],"definite.":[128],"hybrid":[130],"uses":[134],"Newton-type":[136,163],"(variable":[138],"method,":[140,142],"secant":[141],"Newton's":[144],"method)":[145],"bracket":[147],"root,":[149],"followed":[150],"heap-based":[153],"monotone":[154],"point":[156],"search,":[157],"can":[158],"be":[159],"faster":[160],"than":[161],"itself,":[166],"as":[167],"demonstrated":[168],"numerical":[171],"experiments.":[172]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-06-22T08:00:12.763002","created_date":"2025-10-10T00:00:00"}