{"id":"https://openalex.org/W2005777884","doi":"https://doi.org/10.1137/110820762","title":"0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization","display_name":"0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2005777884","doi":"https://doi.org/10.1137/110820762","mag":"2005777884"},"language":"en","primary_location":{"id":"doi:10.1137/110820762","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110820762","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-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/A5036220489","display_name":"Carlos Diego Rodrigues","orcid":"https://orcid.org/0000-0002-8881-5655"},"institutions":[{"id":"https://openalex.org/I243754102","display_name":"Universidade Federal do Cear\u00e1","ror":"https://ror.org/03srtnf24","country_code":"BR","type":"education","lineage":["https://openalex.org/I243754102"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"C. D. Rodrigues","raw_affiliation_strings":["UFC - Universidade Federal do Cear\u00e1 = Federal University of Cear\u00e1 (Av. da Universidade, 2853 - Benfica, Fortaleza - CE, CEP 60020-181 - Brazil)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UFC - Universidade Federal do Cear\u00e1 = Federal University of Cear\u00e1 (Av. da Universidade, 2853 - Benfica, Fortaleza - CE, CEP 60020-181 - Brazil)","institution_ids":["https://openalex.org/I243754102"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110613067","display_name":"Dominique Quadri","orcid":null},"institutions":[{"id":"https://openalex.org/I4210119991","display_name":"Laboratoire Informatique d'Avignon","ror":"https://ror.org/02n399288","country_code":"FR","type":"facility","lineage":["https://openalex.org/I198415970","https://openalex.org/I4210119991"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"D. Quadri","raw_affiliation_strings":["LIA - Laboratoire Informatique d'Avignon (339 Chemin des Meinajaries Agroparc BP 1228 84911 Avignon cedex 9 - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIA - Laboratoire Informatique d'Avignon (339 Chemin des Meinajaries Agroparc BP 1228 84911 Avignon cedex 9 - France)","institution_ids":["https://openalex.org/I4210119991"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016889937","display_name":"Philippe Michelon","orcid":"https://orcid.org/0000-0001-6648-5651"},"institutions":[{"id":"https://openalex.org/I4210119991","display_name":"Laboratoire Informatique d'Avignon","ror":"https://ror.org/02n399288","country_code":"FR","type":"facility","lineage":["https://openalex.org/I198415970","https://openalex.org/I4210119991"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"P. Michelon","raw_affiliation_strings":["LIA - Laboratoire Informatique d'Avignon (339 Chemin des Meinajaries Agroparc BP 1228 84911 Avignon cedex 9 - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIA - Laboratoire Informatique d'Avignon (339 Chemin des Meinajaries Agroparc BP 1228 84911 Avignon cedex 9 - France)","institution_ids":["https://openalex.org/I4210119991"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014362095","display_name":"Serigne Gu\u00e8ye","orcid":"https://orcid.org/0000-0001-7217-8543"},"institutions":[{"id":"https://openalex.org/I4210119991","display_name":"Laboratoire Informatique d'Avignon","ror":"https://ror.org/02n399288","country_code":"FR","type":"facility","lineage":["https://openalex.org/I198415970","https://openalex.org/I4210119991"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"S. Gueye","raw_affiliation_strings":["LIA - Laboratoire Informatique d'Avignon (339 Chemin des Meinajaries Agroparc BP 1228 84911 Avignon cedex 9 - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIA - Laboratoire Informatique d'Avignon (339 Chemin des Meinajaries Agroparc BP 1228 84911 Avignon cedex 9 - France)","institution_ids":["https://openalex.org/I4210119991"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5036220489"],"corresponding_institution_ids":["https://openalex.org/I243754102"],"apc_list":null,"apc_paid":null,"fwci":2.0825,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.8779826,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"22","issue":"4","first_page":"1449","last_page":"1468"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"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.9998000264167786,"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.9957000017166138,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.994700014591217,"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/mathematics","display_name":"Mathematics","score":0.8460285663604736},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.7901343107223511},{"id":"https://openalex.org/keywords/linearization","display_name":"Linearization","score":0.7813438177108765},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7290952205657959},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6160289645195007},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5547206401824951},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5366864204406738},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4959803521633148},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4818097949028015},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45915335416793823},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.439456045627594},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4298549294471741},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.4151373505592346},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3469301462173462},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.09776803851127625},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08037415146827698}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8460285663604736},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7901343107223511},{"id":"https://openalex.org/C11210021","wikidata":"https://www.wikidata.org/wiki/Q1520713","display_name":"Linearization","level":3,"score":0.7813438177108765},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7290952205657959},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6160289645195007},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5547206401824951},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5366864204406738},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4959803521633148},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4818097949028015},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45915335416793823},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.439456045627594},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4298549294471741},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4151373505592346},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3469301462173462},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.09776803851127625},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08037415146827698},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/110820762","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110820762","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01320143v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01320143","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization, 2012, 22 (4), pp.1449-1468. ⟨10.1137/110820762⟩","raw_type":"Journal articles"},{"id":"pmh:oai:HAL:hal-02455911v1","is_oa":false,"landing_page_url":"https://hal.archives-ouvertes.fr/hal-02455911","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1052-6234","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:HAL:hal-05558725v1","is_oa":false,"landing_page_url":"https://hal.science/hal-05558725","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization, 2012, 22 (4), pp.1449-1468. ⟨10.1137/110820762⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W118871189","https://openalex.org/W1971967801","https://openalex.org/W1997993610","https://openalex.org/W2005676331","https://openalex.org/W2007500789","https://openalex.org/W2024911991","https://openalex.org/W2026973340","https://openalex.org/W2028576516","https://openalex.org/W2029859833","https://openalex.org/W2037518368","https://openalex.org/W2041818766","https://openalex.org/W2057884923","https://openalex.org/W2059396883","https://openalex.org/W2074522670","https://openalex.org/W2082782506","https://openalex.org/W2118825986","https://openalex.org/W2122604873","https://openalex.org/W2137023518","https://openalex.org/W2146361854","https://openalex.org/W2150239570","https://openalex.org/W2167925113","https://openalex.org/W2250294758"],"related_works":["https://openalex.org/W2146351753","https://openalex.org/W2402188535","https://openalex.org/W3036464408","https://openalex.org/W2020990755","https://openalex.org/W2377851227","https://openalex.org/W2061823973","https://openalex.org/W4293088966","https://openalex.org/W2366868484","https://openalex.org/W2094365837","https://openalex.org/W2083014164"],"abstract_inverted_index":{"This":[0,64],"paper":[1],"presents":[2],"an":[3],"exact":[4,94],"solution":[5],"method":[6],"based":[7],"on":[8],"a":[9,23,32,53,61],"new":[10],"linearization":[11,39,50],"scheme":[12,91],"for":[13,143,148],"the":[14,93,127,131,136],"0-1":[15],"quadratic":[16,24],"knapsack":[17],"problem,":[18],"which":[19,57],"consists":[20],"of":[21,72,96],"maximizing":[22],"pseudo-Boolean":[25],"function":[26],"with":[27,37,70,92],"nonnegative":[28],"coefficients":[29],"subject":[30],"to":[31,152],"linear":[33],"capacity":[34],"constraint.":[35],"Contrasting":[36],"traditional":[38],"schemes,":[40],"our":[41,89,117],"approach":[42],"adds":[43],"only":[44],"one":[45],"extra":[46],"variable.":[47],"The":[48,113],"suggested":[49],"framework":[51],"provides":[52],"tight":[54],"upper":[55,65,118],"bound,":[56],"is":[58,67,120],"used":[59],"in":[60],"branch-and-bound":[62,90,133],"scheme.":[63],"bound":[66,119],"numerically":[68],"compared":[69],"that":[71,116],"[A.":[73],"Billionnet,":[74],"A.":[75,100],"Faye,":[76],"and":[77,88,103],"E.":[78],"Soutif,":[79],"European":[80],"J.":[81,107],"Oper.":[82],"Res.,":[83],"112":[84],"(1999),":[85],"pp.":[86,111],"664--672],":[87],"algorithm":[95,137],"[W.":[97],"D.":[98],"Pisinger,":[99],"B.":[101],"Rasmussen,":[102],"R.":[104],"Sandvik,":[105],"INFORMS":[106],"Comput.,":[108],"19":[109],"(2007),":[110],"280--290].":[112],"experiments":[114],"show":[115],"quite":[121],"competitive":[122],"(less":[123],"than":[124],"$1\\%$":[125],"from":[126],"optimum).":[128],"In":[129],"addition,":[130],"proposed":[132],"clearly":[134],"outperforms":[135],"developed":[138],"by":[139],"Pisinger":[140],"et":[141],"al.":[142],"low":[144],"density":[145],"instances":[146,150],"($25\\%$)":[147],"all":[149],"up":[151],"$400$":[153],"variables.":[154]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2025-10-10T00:00:00"}