{"id":"https://openalex.org/W2041781650","doi":"https://doi.org/10.1007/s10589-007-9126-9","title":"Algorithm for cardinality-constrained quadratic optimization","display_name":"Algorithm for cardinality-constrained quadratic optimization","publication_year":2007,"publication_date":"2007-11-14","ids":{"openalex":"https://openalex.org/W2041781650","doi":"https://doi.org/10.1007/s10589-007-9126-9","mag":"2041781650"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-007-9126-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10589-007-9126-9","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","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/A5025940525","display_name":"Dimitris Bertsimas","orcid":"https://orcid.org/0000-0002-1985-1003"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dimitris Bertsimas","raw_affiliation_strings":["Sloan School of Management and Operations Research Center, Massachusetts Institute of Technology, E53-363, Cambridge, MA, 02139, USA","Sloan School of Management and Operations Research Center, Massachusetts Institute of Technology, E53-363, Cambridge, USA 02139"],"affiliations":[{"raw_affiliation_string":"Sloan School of Management and Operations Research Center, Massachusetts Institute of Technology, E53-363, Cambridge, MA, 02139, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Sloan School of Management and Operations Research Center, Massachusetts Institute of Technology, E53-363, Cambridge, USA 02139","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014865885","display_name":"Romy Shioda","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Romy Shioda","raw_affiliation_strings":["Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, ON, N2L 3G1, Canada","Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, Canada N2L 3G1"],"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, ON, N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, Canada N2L 3G1","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025940525"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":2.7687,"has_fulltext":false,"cited_by_count":254,"citation_normalized_percentile":{"value":0.9047944,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"43","issue":"1","first_page":"1","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9980999827384949,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.996399998664856,"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.7269440293312073},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.6942097544670105},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6937882900238037},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.684010922908783},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6154876351356506},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6048685312271118},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5239860415458679},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5167950391769409},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4755796492099762},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.45225974917411804},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.44739097356796265},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.41451019048690796},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20883965492248535}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7269440293312073},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.6942097544670105},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6937882900238037},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.684010922908783},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6154876351356506},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6048685312271118},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5239860415458679},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5167950391769409},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4755796492099762},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.45225974917411804},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.44739097356796265},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.41451019048690796},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20883965492248535},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10589-007-9126-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10589-007-9126-9","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.207.8303","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.207.8303","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/dbertsim/www/papers/Optimization/Algorithm%20For%20Cardinality-Constrained%20Quadratic%20Optimization.pdf","raw_type":"text"},{"id":"pmh:oai:RePEc:spr:coopap:v:43:y:2009:i:1:p:1-22","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1007/s10589-007-9126-9","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1969423031","https://openalex.org/W1974478886","https://openalex.org/W1981525111","https://openalex.org/W1991875623","https://openalex.org/W2000151369","https://openalex.org/W2005165550","https://openalex.org/W2006016498","https://openalex.org/W2041453753","https://openalex.org/W2042442229","https://openalex.org/W2052890323","https://openalex.org/W2087493275","https://openalex.org/W2089649903","https://openalex.org/W2092412407","https://openalex.org/W2116798985","https://openalex.org/W2121562790","https://openalex.org/W2128196627","https://openalex.org/W2144015438","https://openalex.org/W2151237529","https://openalex.org/W2152122625","https://openalex.org/W2160688039","https://openalex.org/W2166029977","https://openalex.org/W2170120409","https://openalex.org/W2170221568","https://openalex.org/W2597573043","https://openalex.org/W2797502950","https://openalex.org/W3148930403","https://openalex.org/W4205337121","https://openalex.org/W4205969772","https://openalex.org/W4233674284","https://openalex.org/W4240628542","https://openalex.org/W4285719527","https://openalex.org/W4378195498","https://openalex.org/W6814303061"],"related_works":["https://openalex.org/W2084616826","https://openalex.org/W2008600006","https://openalex.org/W1968202374","https://openalex.org/W2009796757","https://openalex.org/W3153884794","https://openalex.org/W2482371100","https://openalex.org/W2275468419","https://openalex.org/W125276123","https://openalex.org/W1971357083","https://openalex.org/W2354460058"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":13},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":23},{"year":2022,"cited_by_count":15},{"year":2021,"cited_by_count":20},{"year":2020,"cited_by_count":18},{"year":2019,"cited_by_count":19},{"year":2018,"cited_by_count":18},{"year":2017,"cited_by_count":22},{"year":2016,"cited_by_count":20},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":17},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":14}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}