{"id":"https://openalex.org/W2070511462","doi":"https://doi.org/10.1007/bf01096999","title":"A finite concave minimization algorithm using branch and bound and neighbor generation","display_name":"A finite concave minimization algorithm using branch and bound and neighbor generation","publication_year":1994,"publication_date":"1994-07-01","ids":{"openalex":"https://openalex.org/W2070511462","doi":"https://doi.org/10.1007/bf01096999","mag":"2070511462"},"language":"en","primary_location":{"id":"doi:10.1007/bf01096999","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01096999","pdf_url":null,"source":{"id":"https://openalex.org/S115925768","display_name":"Journal of Global Optimization","issn_l":"0925-5001","issn":["0925-5001","1573-2916"],"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":"Journal of Global 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/A5005799055","display_name":"Harold P. Benson","orcid":null},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Harold P. Benson","raw_affiliation_strings":["Department of Decision and Information Sciences, University of Florida, 32611-2017, Gainesville, FL, USA","Dept. of Decision & Information Sciences, University of Florida, Gainesville, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Decision and Information Sciences, University of Florida, 32611-2017, Gainesville, FL, USA","institution_ids":["https://openalex.org/I33213144"]},{"raw_affiliation_string":"Dept. of Decision & Information Sciences, University of Florida, Gainesville, USA","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049900046","display_name":"Serpil Say\u0131n","orcid":"https://orcid.org/0000-0002-3672-0769"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Serpil Sayin","raw_affiliation_strings":["Department of Decision and Information Sciences, University of Florida, 32611-2017, Gainesville, FL, USA","Dept. of Decision & Information Sciences, University of Florida, Gainesville, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Decision and Information Sciences, University of Florida, 32611-2017, Gainesville, FL, USA","institution_ids":["https://openalex.org/I33213144"]},{"raw_affiliation_string":"Dept. of Decision & Information Sciences, University of Florida, Gainesville, USA","institution_ids":["https://openalex.org/I33213144"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I33213144"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2780},"apc_paid":null,"fwci":3.8042,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.93457498,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"5","issue":"1","first_page":"1","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9988999962806702,"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.9988999962806702,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9901000261306763,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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.9857000112533569,"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.839542806148529},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.7407610416412354},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.5701125860214233},{"id":"https://openalex.org/keywords/concave-function","display_name":"Concave function","score":0.566601037979126},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.5506989359855652},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5148114562034607},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5109183192253113},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4803008437156677},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4732150137424469},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4633595943450928},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4362005293369293},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4337376356124878},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4244357645511627},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2951350808143616},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06911984086036682},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0691080391407013}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.839542806148529},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.7407610416412354},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.5701125860214233},{"id":"https://openalex.org/C66690126","wikidata":"https://www.wikidata.org/wiki/Q2914302","display_name":"Concave function","level":3,"score":0.566601037979126},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.5506989359855652},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5148114562034607},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5109183192253113},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4803008437156677},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4732150137424469},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4633595943450928},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4362005293369293},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4337376356124878},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4244357645511627},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2951350808143616},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06911984086036682},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0691080391407013},{"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/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":2,"locations":[{"id":"doi:10.1007/bf01096999","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01096999","pdf_url":null,"source":{"id":"https://openalex.org/S115925768","display_name":"Journal of Global Optimization","issn_l":"0925-5001","issn":["0925-5001","1573-2916"],"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":"Journal of Global Optimization","raw_type":"journal-article"},{"id":"pmh:oai:repository.bilkent.edu.tr:11693/49057","is_oa":false,"landing_page_url":"http://hdl.handle.net/11693/49057","pdf_url":null,"source":{"id":"https://openalex.org/S4306400079","display_name":"Bilkent University Institutional Repository (Bilkent University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I168864056","host_organization_name":"Bilkent University","host_organization_lineage":["https://openalex.org/I168864056"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Global Optimization","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W180275413","https://openalex.org/W343583240","https://openalex.org/W1497951585","https://openalex.org/W1499399028","https://openalex.org/W1568612004","https://openalex.org/W1977816751","https://openalex.org/W2019908282","https://openalex.org/W2023582597","https://openalex.org/W2027527884","https://openalex.org/W2039526985","https://openalex.org/W2043339930","https://openalex.org/W2049536263","https://openalex.org/W2059015127","https://openalex.org/W2059690973","https://openalex.org/W2077519839","https://openalex.org/W2089656647","https://openalex.org/W2090765654","https://openalex.org/W2108796912","https://openalex.org/W2157924277","https://openalex.org/W2610216665","https://openalex.org/W4239256746","https://openalex.org/W4254522940","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2916043681","https://openalex.org/W2896131632","https://openalex.org/W2391438543","https://openalex.org/W2008231869","https://openalex.org/W323119424","https://openalex.org/W2050941468","https://openalex.org/W2897798781","https://openalex.org/W127284643","https://openalex.org/W217463380","https://openalex.org/W2043339930"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-01-15T23:16:33.117629","created_date":"2025-10-10T00:00:00"}
