{"id":"https://openalex.org/W2804302623","doi":"https://doi.org/10.1007/s12532-018-0138-5","title":"A hybrid LP/NLP paradigm for global optimization relaxations","display_name":"A hybrid LP/NLP paradigm for global optimization relaxations","publication_year":2018,"publication_date":"2018-05-14","ids":{"openalex":"https://openalex.org/W2804302623","doi":"https://doi.org/10.1007/s12532-018-0138-5","mag":"2804302623"},"language":"en","primary_location":{"id":"doi:10.1007/s12532-018-0138-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12532-018-0138-5","pdf_url":null,"source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"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 Computation","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/A5059503583","display_name":"Aida Khajavirad","orcid":"https://orcid.org/0000-0002-7097-1676"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Aida Khajavirad","raw_affiliation_strings":["Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031811254","display_name":"Nikolaos V. Sahinidis","orcid":"https://orcid.org/0000-0003-2087-9131"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nikolaos V. Sahinidis","raw_affiliation_strings":["Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059503583"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":{"value":2390,"currency":"EUR","value_usd":3090},"apc_paid":null,"fwci":10.2396,"has_fulltext":false,"cited_by_count":120,"citation_normalized_percentile":{"value":0.98891199,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"10","issue":"3","first_page":"383","last_page":"421"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9997000098228455,"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.9997000098228455,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9894000291824341,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T11435","display_name":"Polynomial and algebraic computation","score":0.9793999791145325,"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/global-optimization","display_name":"Global optimization","score":0.6986058354377747},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6789296865463257},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.6490161418914795},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6179909110069275},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5696401596069336},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5234529376029968},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5167502760887146},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.49571430683135986},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.48165881633758545},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4776262640953064},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.47381606698036194},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4359395205974579},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4244946837425232},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3795977830886841},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.34494343400001526},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3254491686820984},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.12165677547454834},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1185096800327301}],"concepts":[{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.6986058354377747},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6789296865463257},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.6490161418914795},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6179909110069275},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5696401596069336},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5234529376029968},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5167502760887146},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.49571430683135986},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.48165881633758545},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4776262640953064},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.47381606698036194},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4359395205974579},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4244946837425232},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3795977830886841},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.34494343400001526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3254491686820984},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.12165677547454834},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1185096800327301},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s12532-018-0138-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12532-018-0138-5","pdf_url":null,"source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"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 Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W10227180","https://openalex.org/W54096403","https://openalex.org/W78236450","https://openalex.org/W114465074","https://openalex.org/W1503382895","https://openalex.org/W1884347414","https://openalex.org/W1975903957","https://openalex.org/W1979102995","https://openalex.org/W1988622494","https://openalex.org/W2001741445","https://openalex.org/W2004407575","https://openalex.org/W2021674665","https://openalex.org/W2022484305","https://openalex.org/W2023054591","https://openalex.org/W2023653074","https://openalex.org/W2050339136","https://openalex.org/W2056276294","https://openalex.org/W2067569795","https://openalex.org/W2069223201","https://openalex.org/W2069808690","https://openalex.org/W2071334094","https://openalex.org/W2074372644","https://openalex.org/W2076722072","https://openalex.org/W2084006722","https://openalex.org/W2123871098","https://openalex.org/W2132710986","https://openalex.org/W2133520239","https://openalex.org/W2149454052","https://openalex.org/W2151460223","https://openalex.org/W2155258508","https://openalex.org/W2170213261","https://openalex.org/W2178935672","https://openalex.org/W2296319761","https://openalex.org/W2479293754","https://openalex.org/W2611709461","https://openalex.org/W2917843279","https://openalex.org/W4248623816","https://openalex.org/W4250589301"],"related_works":["https://openalex.org/W2165085685","https://openalex.org/W2029446116","https://openalex.org/W2170422083","https://openalex.org/W2087596644","https://openalex.org/W1999926325","https://openalex.org/W4304192591","https://openalex.org/W2158318958","https://openalex.org/W2108334735","https://openalex.org/W1989257897","https://openalex.org/W2389899617"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":9},{"year":2025,"cited_by_count":19},{"year":2024,"cited_by_count":33},{"year":2023,"cited_by_count":15},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-12T07:58:50.170612","created_date":"2025-10-10T00:00:00"}