{"id":"https://openalex.org/W605256861","doi":"https://doi.org/10.1007/s10107-015-0918-x","title":"An efficient global algorithm for a class of indefinite separable quadratic programs","display_name":"An efficient global algorithm for a class of indefinite separable quadratic programs","publication_year":2015,"publication_date":"2015-06-03","ids":{"openalex":"https://openalex.org/W605256861","doi":"https://doi.org/10.1007/s10107-015-0918-x","mag":"605256861"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-015-0918-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-015-0918-x","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","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/A5039896411","display_name":"Chanaka Edirisinghe","orcid":"https://orcid.org/0000-0002-3623-3119"},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chanaka Edirisinghe","raw_affiliation_strings":["Rensselaer Polytechnic Institute (RPI), Troy, NY, USA","Rensselaer Polytechnic Institute (RPI), Troy, USA"],"affiliations":[{"raw_affiliation_string":"Rensselaer Polytechnic Institute (RPI), Troy, NY, USA","institution_ids":["https://openalex.org/I165799507"]},{"raw_affiliation_string":"Rensselaer Polytechnic Institute (RPI), Troy, USA","institution_ids":["https://openalex.org/I165799507"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021522906","display_name":"Jaehwan Jeong","orcid":"https://orcid.org/0000-0002-2290-2035"},"institutions":[{"id":"https://openalex.org/I53559539","display_name":"Radford University","ror":"https://ror.org/04647g470","country_code":"US","type":"education","lineage":["https://openalex.org/I53559539"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jaehwan Jeong","raw_affiliation_strings":["Radford University, Radford, VA, USA","Radford University, Radford, USA"],"affiliations":[{"raw_affiliation_string":"Radford University, Radford, VA, USA","institution_ids":["https://openalex.org/I53559539"]},{"raw_affiliation_string":"Radford University, Radford, USA","institution_ids":["https://openalex.org/I53559539"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5039896411"],"corresponding_institution_ids":["https://openalex.org/I165799507"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.7019,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.7317314,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"158","issue":"1-2","first_page":"143","last_page":"173"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9969000220298767,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.996399998664856,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/karush\u2013kuhn\u2013tucker-conditions","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","score":0.8439580202102661},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.742555558681488},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6175873875617981},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6054922342300415},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5692393779754639},{"id":"https://openalex.org/keywords/global-optimization","display_name":"Global optimization","score":0.5346471667289734},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.5319023132324219},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5308074951171875},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.5187640190124512},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5104793310165405},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.46329745650291443},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4599136412143707},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4442334771156311},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2108210325241089}],"concepts":[{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.8439580202102661},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.742555558681488},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6175873875617981},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6054922342300415},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5692393779754639},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.5346471667289734},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.5319023132324219},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5308074951171875},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.5187640190124512},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5104793310165405},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.46329745650291443},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4599136412143707},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4442334771156311},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2108210325241089},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-015-0918-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-015-0918-x","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W199950694","https://openalex.org/W202383464","https://openalex.org/W1969757890","https://openalex.org/W1984818365","https://openalex.org/W1987755233","https://openalex.org/W1991907403","https://openalex.org/W1995246641","https://openalex.org/W2000923338","https://openalex.org/W2004732730","https://openalex.org/W2031494345","https://openalex.org/W2058731530","https://openalex.org/W2061211758","https://openalex.org/W2118402343","https://openalex.org/W2171103562","https://openalex.org/W2301746362","https://openalex.org/W2787523326","https://openalex.org/W2991337620","https://openalex.org/W4232647772","https://openalex.org/W4234534407","https://openalex.org/W4236127247"],"related_works":["https://openalex.org/W2164754346","https://openalex.org/W4378551200","https://openalex.org/W2610069809","https://openalex.org/W2070901360","https://openalex.org/W2083014164","https://openalex.org/W2031345939","https://openalex.org/W2007827522","https://openalex.org/W1520136989","https://openalex.org/W2026826235","https://openalex.org/W2352291778"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}