{"id":"https://openalex.org/W1987622728","doi":"https://doi.org/10.1016/0305-0548(94)90007-8","title":"A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron","display_name":"A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron","publication_year":1994,"publication_date":"1994-08-01","ids":{"openalex":"https://openalex.org/W1987622728","doi":"https://doi.org/10.1016/0305-0548(94)90007-8","mag":"1987622728"},"language":"en","primary_location":{"id":"doi:10.1016/0305-0548(94)90007-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0305-0548(94)90007-8","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","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/A5024890889","display_name":"Kurt M. Bretthauer","orcid":"https://orcid.org/0000-0002-7785-750X"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kurt M. Bretthauer","raw_affiliation_strings":["Department of Business Analysis and Research, Texas A&M University, College Station, TX 77843 USA"],"affiliations":[{"raw_affiliation_string":"Department of Business Analysis and Research, Texas A&M University, College Station, TX 77843 USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5104364842","display_name":"A. Victor Cabot","orcid":null},"institutions":[{"id":"https://openalex.org/I4210119109","display_name":"Indiana University Bloomington","ror":"https://ror.org/02k40bc56","country_code":"US","type":"education","lineage":["https://openalex.org/I4210119109","https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A.Victor Cabot","raw_affiliation_strings":["Department of Decision and Information Systems, Indiana University, Bloomington, IN 47405, U.S.A","Department of Decision and Information Systems Indiana University, Bloomington, IN 47405, U.S.A.#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Decision and Information Systems, Indiana University, Bloomington, IN 47405, U.S.A","institution_ids":[]},{"raw_affiliation_string":"Department of Decision and Information Systems Indiana University, Bloomington, IN 47405, U.S.A.#TAB#","institution_ids":["https://openalex.org/I4210119109"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5024890889"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":1.6359,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.81614136,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"21","issue":"7","first_page":"777","last_page":"785"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9994999766349792,"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.9994999766349792,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9884999990463257,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9883000254631042,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.770106315612793},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.7453755140304565},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6344013214111328},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.613622784614563},{"id":"https://openalex.org/keywords/concave-function","display_name":"Concave function","score":0.6093393564224243},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5949884653091431},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.5645594596862793},{"id":"https://openalex.org/keywords/hyperplane","display_name":"Hyperplane","score":0.5552350282669067},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5508381128311157},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.48947441577911377},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4400283694267273},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4221614599227905},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3625043034553528},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3242912292480469},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.15486615896224976},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.14453774690628052},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08295240998268127},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.07948556542396545}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.770106315612793},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.7453755140304565},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6344013214111328},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.613622784614563},{"id":"https://openalex.org/C66690126","wikidata":"https://www.wikidata.org/wiki/Q2914302","display_name":"Concave function","level":3,"score":0.6093393564224243},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5949884653091431},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.5645594596862793},{"id":"https://openalex.org/C68693459","wikidata":"https://www.wikidata.org/wiki/Q657586","display_name":"Hyperplane","level":2,"score":0.5552350282669067},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5508381128311157},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.48947441577911377},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4400283694267273},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4221614599227905},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3625043034553528},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3242912292480469},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.15486615896224976},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.14453774690628052},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08295240998268127},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.07948556542396545},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0305-0548(94)90007-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0305-0548(94)90007-8","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","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":47,"referenced_works":["https://openalex.org/W15213506","https://openalex.org/W63329702","https://openalex.org/W80501282","https://openalex.org/W1499399028","https://openalex.org/W1568612004","https://openalex.org/W1571958156","https://openalex.org/W1587078255","https://openalex.org/W1963908413","https://openalex.org/W1965134187","https://openalex.org/W1966972789","https://openalex.org/W1968119063","https://openalex.org/W1968707428","https://openalex.org/W1970855160","https://openalex.org/W1986778884","https://openalex.org/W1992765037","https://openalex.org/W2019908282","https://openalex.org/W2023582597","https://openalex.org/W2027527884","https://openalex.org/W2028498002","https://openalex.org/W2034333768","https://openalex.org/W2039551591","https://openalex.org/W2041603754","https://openalex.org/W2043339930","https://openalex.org/W2043806437","https://openalex.org/W2047773517","https://openalex.org/W2053060496","https://openalex.org/W2059690973","https://openalex.org/W2061703616","https://openalex.org/W2064973050","https://openalex.org/W2070501901","https://openalex.org/W2070511462","https://openalex.org/W2073064493","https://openalex.org/W2073174101","https://openalex.org/W2075990255","https://openalex.org/W2077054297","https://openalex.org/W2080176670","https://openalex.org/W2084927502","https://openalex.org/W2085844492","https://openalex.org/W2089656647","https://openalex.org/W2090765654","https://openalex.org/W2098968017","https://openalex.org/W2111671783","https://openalex.org/W2157924277","https://openalex.org/W2167539320","https://openalex.org/W4251867147","https://openalex.org/W6634143757","https://openalex.org/W6635191537"],"related_works":["https://openalex.org/W4205506869","https://openalex.org/W3162501176","https://openalex.org/W2071760804","https://openalex.org/W2113011069","https://openalex.org/W3104290058","https://openalex.org/W2354201224","https://openalex.org/W4303982878","https://openalex.org/W2897798781","https://openalex.org/W2091662678","https://openalex.org/W2560954080"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}