{"id":"https://openalex.org/W2547781575","doi":"https://doi.org/10.1007/s10107-016-1082-7","title":"Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time","display_name":"Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time","publication_year":2016,"publication_date":"2016-11-05","ids":{"openalex":"https://openalex.org/W2547781575","doi":"https://doi.org/10.1007/s10107-016-1082-7","mag":"2547781575"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-016-1082-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-016-1082-7","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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rensselaer Polytechnic Institute (RPI), Troy, NY, 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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Radford University, Radford, VA, 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":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.8505,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.74079422,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"164","issue":"1-2","first_page":"193","last_page":"227"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9977999925613403,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9972000122070312,"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.7912871837615967},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6483339071273804},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.5777396559715271},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5404736399650574},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.48261579871177673},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4488539695739746},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.438351035118103},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4306187033653259},{"id":"https://openalex.org/keywords/duality-gap","display_name":"Duality gap","score":0.41923829913139343},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41903120279312134},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.40531861782073975},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.31134140491485596},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12121033668518066},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09512156248092651}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7912871837615967},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6483339071273804},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.5777396559715271},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5404736399650574},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.48261579871177673},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4488539695739746},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.438351035118103},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4306187033653259},{"id":"https://openalex.org/C5274546","wikidata":"https://www.wikidata.org/wiki/Q5310264","display_name":"Duality gap","level":3,"score":0.41923829913139343},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41903120279312134},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.40531861782073975},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.31134140491485596},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12121033668518066},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09512156248092651},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-016-1082-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-016-1082-7","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":[{"id":"https://metadata.un.org/sdg/10","score":0.5199999809265137,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W605256861","https://openalex.org/W1991907403","https://openalex.org/W2000923338","https://openalex.org/W2004732730","https://openalex.org/W2009650852","https://openalex.org/W2010997912","https://openalex.org/W2018984203","https://openalex.org/W2034027023","https://openalex.org/W2052489360","https://openalex.org/W2058731530","https://openalex.org/W2105595722","https://openalex.org/W2127172809","https://openalex.org/W2156293131","https://openalex.org/W2481108008","https://openalex.org/W2787523326","https://openalex.org/W4234534407"],"related_works":["https://openalex.org/W1914177958","https://openalex.org/W2091971915","https://openalex.org/W2013441581","https://openalex.org/W1982444996","https://openalex.org/W2068909209","https://openalex.org/W2022629531","https://openalex.org/W3197907922","https://openalex.org/W2570531761","https://openalex.org/W2156434656","https://openalex.org/W1996545455"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}