{"id":"https://openalex.org/W2736798316","doi":"https://doi.org/10.1080/10556788.2017.1350178","title":"Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON","display_name":"Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON","publication_year":2017,"publication_date":"2017-07-18","ids":{"openalex":"https://openalex.org/W2736798316","doi":"https://doi.org/10.1080/10556788.2017.1350178","mag":"2736798316"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2017.1350178","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2017.1350178","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5045425870","display_name":"Mustafa R. K\u0131l\u0131n\u00e7","orcid":"https://orcid.org/0000-0002-6497-8628"},"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":"Mustafa R. K\u0131l\u0131n\u00e7","raw_affiliation_strings":["Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"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":true,"raw_author_name":"Nikolaos V. Sahinidis","raw_affiliation_strings":["Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0000-0003-2087-9131","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/A5031811254"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":20.5534,"has_fulltext":false,"cited_by_count":163,"citation_normalized_percentile":{"value":0.99689589,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"33","issue":"3","first_page":"540","last_page":"562"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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.9943000078201294,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9909999966621399,"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/integer-programming","display_name":"Integer programming","score":0.7666942477226257},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.6467012166976929},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6185480356216431},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5910028219223022},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5886224508285522},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.5874492526054382},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5822911262512207},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5110422372817993},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5092772245407104},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.5021939277648926},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5004291534423828},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4735614061355591},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.470515638589859},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4490891993045807},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3750441372394562}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7666942477226257},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.6467012166976929},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6185480356216431},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5910028219223022},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5886224508285522},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.5874492526054382},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5822911262512207},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5110422372817993},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5092772245407104},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.5021939277648926},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5004291534423828},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4735614061355591},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.470515638589859},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4490891993045807},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3750441372394562},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2017.1350178","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2017.1350178","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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":56,"referenced_works":["https://openalex.org/W10227180","https://openalex.org/W114465074","https://openalex.org/W603729728","https://openalex.org/W1481924060","https://openalex.org/W1497465005","https://openalex.org/W1546461095","https://openalex.org/W1918578756","https://openalex.org/W1975903957","https://openalex.org/W1979102995","https://openalex.org/W1988622494","https://openalex.org/W1997843845","https://openalex.org/W2001451578","https://openalex.org/W2001741445","https://openalex.org/W2004407575","https://openalex.org/W2004489140","https://openalex.org/W2005320876","https://openalex.org/W2021674665","https://openalex.org/W2022484305","https://openalex.org/W2023059010","https://openalex.org/W2026964350","https://openalex.org/W2041252457","https://openalex.org/W2041754841","https://openalex.org/W2050339136","https://openalex.org/W2050613227","https://openalex.org/W2056337104","https://openalex.org/W2060514920","https://openalex.org/W2064267171","https://openalex.org/W2067569795","https://openalex.org/W2079585172","https://openalex.org/W2084006722","https://openalex.org/W2085457376","https://openalex.org/W2091552912","https://openalex.org/W2104840146","https://openalex.org/W2106106289","https://openalex.org/W2123871098","https://openalex.org/W2128971018","https://openalex.org/W2133304166","https://openalex.org/W2137977650","https://openalex.org/W2149454052","https://openalex.org/W2155014525","https://openalex.org/W2155258508","https://openalex.org/W2160783673","https://openalex.org/W2167539320","https://openalex.org/W2168004511","https://openalex.org/W2418368257","https://openalex.org/W2557918589","https://openalex.org/W2576928011","https://openalex.org/W2745993358","https://openalex.org/W2804302623","https://openalex.org/W2894871027","https://openalex.org/W2916974679","https://openalex.org/W3105187766","https://openalex.org/W4212864101","https://openalex.org/W4232585008","https://openalex.org/W4238484605","https://openalex.org/W4243368091"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W2024753861","https://openalex.org/W2387389269","https://openalex.org/W2158503982","https://openalex.org/W4210880521","https://openalex.org/W134055995","https://openalex.org/W2110818895","https://openalex.org/W2568448495","https://openalex.org/W2081493497","https://openalex.org/W2218893665"],"abstract_inverted_index":{"In":[0,75],"this":[1],"paper,":[2],"we":[3,126,143],"present":[4],"recent":[5],"developments":[6],"in":[7,92,119,161],"the":[8,23,56,93,97,109,156,162,171],"global":[9],"optimization":[10],"software":[11],"BARON":[12,120],"to":[13,30,40,63,77,87,121,154],"address":[14],"problems":[15],"with":[16],"integer":[17,89,112],"variables.":[18],"A":[19],"primary":[20],"development":[21],"was":[22],"addition":[24,76],"of":[25,33,58,95,111,135,158],"mixed-integer":[26,136],"linear":[27,34,113],"programming":[28,37,90,114],"relaxations":[29,54,91],"BARON's":[31,79,128],"portfolio":[32],"and":[35,44,103,115,165],"nonlinear":[36,123,137],"relaxations,":[38],"aiming":[39,153],"improve":[41],"dual":[42],"bounds":[43],"offer":[45],"good":[46,133],"starting":[47],"points":[48],"for":[49,82,131],"primal":[50,129],"heuristics.":[51],"Since":[52],"such":[53],"necessitate":[55],"solution":[57,163,170],"NP-hard":[59],"problems,":[60],"their":[61,72],"introduction":[62],"a":[64,149],"branch-and-bound":[65],"algorithm":[66],"raises":[67],"many":[68],"practical":[69],"issues":[70],"regarding":[71],"effective":[73],"implementation.":[74],"describing":[78],"dynamic":[80],"strategy":[81],"deciding":[83],"under":[84],"what":[85],"conditions":[86],"activate":[88],"course":[94],"branch-and-bound,":[96],"paper":[98],"also":[99],"describes":[100],"cutting":[101],"plane":[102],"probing":[104],"techniques":[105,167],"that":[106,168],"originate":[107],"from":[108],"literature":[110],"have":[116],"been":[117],"adapted":[118],"solve":[122],"problems.":[124],"Finally,":[125],"describe":[127],"heuristics":[130],"finding":[132],"solutions":[134],"programmes.":[138],"For":[139],"all":[140],"these":[141],"techniques,":[142],"report":[144],"extensive":[145],"computational":[146],"results":[147],"on":[148],"public":[150],"data":[151],"set,":[152],"analyse":[155],"impact":[157],"each":[159],"technique":[160],"process":[164],"identify":[166],"expedite":[169],"most.":[172]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":18},{"year":2023,"cited_by_count":18},{"year":2022,"cited_by_count":23},{"year":2021,"cited_by_count":31},{"year":2020,"cited_by_count":24},{"year":2019,"cited_by_count":26},{"year":2018,"cited_by_count":8}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}