{"id":"https://openalex.org/W2082907011","doi":"https://doi.org/10.1007/bf01100242","title":"A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case","display_name":"A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case","publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W2082907011","doi":"https://doi.org/10.1007/bf01100242","mag":"2082907011"},"language":"en","primary_location":{"id":"doi:10.1007/bf01100242","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01100242","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":true,"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"],"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":["https://openalex.org/A5005799055"],"corresponding_institution_ids":["https://openalex.org/I33213144"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2780},"apc_paid":null,"fwci":2.7925,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.91755185,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"3","issue":"1","first_page":"95","last_page":"111"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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.9976999759674072,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9932000041007996,"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/subroutine","display_name":"Subroutine","score":0.8516712188720703},{"id":"https://openalex.org/keywords/bisection-method","display_name":"Bisection method","score":0.8401226997375488},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7059392333030701},{"id":"https://openalex.org/keywords/extreme-point","display_name":"Extreme point","score":0.678308367729187},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5948128700256348},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.573324978351593},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.569071888923645},{"id":"https://openalex.org/keywords/bisection","display_name":"Bisection","score":0.5576067566871643},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5501317977905273},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5489075183868408},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5469276905059814},{"id":"https://openalex.org/keywords/criss-cross-algorithm","display_name":"Criss-cross algorithm","score":0.5001742839813232},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.22479942440986633},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22305676341056824},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.053192973136901855}],"concepts":[{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.8516712188720703},{"id":"https://openalex.org/C157544257","wikidata":"https://www.wikidata.org/wiki/Q866300","display_name":"Bisection method","level":2,"score":0.8401226997375488},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7059392333030701},{"id":"https://openalex.org/C39847760","wikidata":"https://www.wikidata.org/wiki/Q1385465","display_name":"Extreme point","level":2,"score":0.678308367729187},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5948128700256348},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.573324978351593},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.569071888923645},{"id":"https://openalex.org/C31599958","wikidata":"https://www.wikidata.org/wiki/Q3128632","display_name":"Bisection","level":2,"score":0.5576067566871643},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5501317977905273},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5489075183868408},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5469276905059814},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.5001742839813232},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.22479942440986633},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22305676341056824},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.053192973136901855},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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":1,"locations":[{"id":"doi:10.1007/bf01100242","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01100242","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1484329423","https://openalex.org/W1499399028","https://openalex.org/W1568612004","https://openalex.org/W1966139157","https://openalex.org/W1978387282","https://openalex.org/W1981284334","https://openalex.org/W1987013673","https://openalex.org/W1991794409","https://openalex.org/W1998355343","https://openalex.org/W2010245689","https://openalex.org/W2010997912","https://openalex.org/W2015910646","https://openalex.org/W2019344905","https://openalex.org/W2021615962","https://openalex.org/W2030406435","https://openalex.org/W2032514919","https://openalex.org/W2036737894","https://openalex.org/W2043339930","https://openalex.org/W2047295894","https://openalex.org/W2082396019","https://openalex.org/W2086721910","https://openalex.org/W2093807570","https://openalex.org/W2095362832","https://openalex.org/W2100932117","https://openalex.org/W2920966226","https://openalex.org/W4206576091","https://openalex.org/W4211142825","https://openalex.org/W4233551186","https://openalex.org/W4244339246","https://openalex.org/W4246092883","https://openalex.org/W4255037432"],"related_works":["https://openalex.org/W2329494729","https://openalex.org/W41290553","https://openalex.org/W3112697985","https://openalex.org/W1986919722","https://openalex.org/W2585516632","https://openalex.org/W2093663313","https://openalex.org/W4296983618","https://openalex.org/W2158390333","https://openalex.org/W40332083","https://openalex.org/W2082907011"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}