{"id":"https://openalex.org/W2053862301","doi":"https://doi.org/10.1137/s1052623494268455","title":"Numerical Experience with Lower Bounds for MIQP Branch-And-Bound","display_name":"Numerical Experience with Lower Bounds for MIQP Branch-And-Bound","publication_year":1998,"publication_date":"1998-05-01","ids":{"openalex":"https://openalex.org/W2053862301","doi":"https://doi.org/10.1137/s1052623494268455","mag":"2053862301"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623494268455","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623494268455","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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/A5088683774","display_name":"R. Fletcher","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Roger Fletcher","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5084814006","display_name":"Sven Leyffer","orcid":"https://orcid.org/0000-0001-8839-5876"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sven Leyffer","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.7644,"has_fulltext":false,"cited_by_count":216,"citation_normalized_percentile":{"value":0.96440437,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"8","issue":"2","first_page":"604","last_page":"616"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9943000078201294,"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.9943000078201294,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.9886999726295471,"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/T11053","display_name":"Process Optimization and Integration","score":0.9871000051498413,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7702476382255554},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.7371287941932678},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.6545036435127258},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6381537914276123},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6123533248901367},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5257561802864075},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.5134497880935669},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4974959194660187},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4925757050514221},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.48270106315612793},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.432912141084671},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4282422661781311},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14993801712989807},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.05932646989822388}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7702476382255554},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.7371287941932678},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.6545036435127258},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6381537914276123},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6123533248901367},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5257561802864075},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.5134497880935669},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4974959194660187},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4925757050514221},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.48270106315612793},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.432912141084671},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4282422661781311},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14993801712989807},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.05932646989822388},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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":2,"locations":[{"id":"doi:10.1137/s1052623494268455","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623494268455","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.42.3167","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.3167","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.maths.dundee.ac.uk/~sleyffer/miqp_art.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W177736772","https://openalex.org/W1487048116","https://openalex.org/W1748199557","https://openalex.org/W1983294952","https://openalex.org/W1997215277","https://openalex.org/W1999049191","https://openalex.org/W2000060152","https://openalex.org/W2016411699","https://openalex.org/W2029242918","https://openalex.org/W2033735555","https://openalex.org/W2057338659","https://openalex.org/W2061962896","https://openalex.org/W2066875914","https://openalex.org/W2067801736","https://openalex.org/W2071334094","https://openalex.org/W2075194837","https://openalex.org/W2077424364","https://openalex.org/W2077658674","https://openalex.org/W2091364465","https://openalex.org/W2092068641","https://openalex.org/W2147365104","https://openalex.org/W2159307101","https://openalex.org/W2336259629","https://openalex.org/W4240374930"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W2941986668","https://openalex.org/W2084616826","https://openalex.org/W1997215277","https://openalex.org/W1983294952","https://openalex.org/W1968202374","https://openalex.org/W2889871839","https://openalex.org/W2024753861","https://openalex.org/W1595394363","https://openalex.org/W2354460058"],"abstract_inverted_index":{"The":[0,55],"solution":[1],"of":[2,45],"convex":[3],"mixed-integer":[4],"quadratic":[5,46],"programming":[6,47],"(MIQP)":[7],"problems":[8,49],"with":[9],"a":[10],"general":[11],"branch-and-bound":[12,28,56],"framework":[13],"is":[14,17,58,73],"considered.":[15],"It":[16],"shown":[18,60],"how":[19],"lower":[20,31],"bounds":[21,32],"can":[22,41],"be":[23,53,62],"computed":[24],"efficiently":[25],"during":[26],"the":[27,35,43],"process.":[29],"Improved":[30],"such":[33],"as":[34],"ones":[36],"derived":[37],"in":[38,67],"this":[39],"paper":[40],"reduce":[42],"number":[44],"(QP)":[48],"that":[50],"have":[51],"to":[52,61,64],"solved.":[54],"approach":[57],"also":[59],"superior":[63],"other":[65],"approaches":[66],"solving":[68],"MIQP":[69],"problems.":[70],"Numerical":[71],"experience":[72],"presented":[74],"which":[75],"supports":[76],"these":[77],"conclusions.":[78]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":6}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}