{"id":"https://openalex.org/W2036159384","doi":"https://doi.org/10.1007/bf01498333","title":"An algorithm for minimax","display_name":"An algorithm for minimax","publication_year":1991,"publication_date":"1991-09-01","ids":{"openalex":"https://openalex.org/W2036159384","doi":"https://doi.org/10.1007/bf01498333","mag":"2036159384"},"language":"en","primary_location":{"id":"doi:10.1007/bf01498333","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01498333","pdf_url":null,"source":{"id":"https://openalex.org/S126160977","display_name":"Mathematical Methods of Operations Research","issn_l":"1432-2994","issn":["1432-2994","1432-5217"],"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":"ZOR - Methods and Models of 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/A5042825283","display_name":"B. D. Craven","orcid":null},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"B. D. Craven","raw_affiliation_strings":["Mathematics Department, University of Melbourne, 3052, Parkville, Victoria, Australia","Mathematics Department, University of Melbourne, Parkville, Australia#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematics Department, University of Melbourne, 3052, Parkville, Victoria, Australia","institution_ids":["https://openalex.org/I165779595"]},{"raw_affiliation_string":"Mathematics Department, University of Melbourne, Parkville, Australia#TAB#","institution_ids":["https://openalex.org/I165779595"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5042825283"],"corresponding_institution_ids":["https://openalex.org/I165779595"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.21035169,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"35","issue":"5","first_page":"425","last_page":"434"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9840999841690063,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9580000042915344,"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/minimax","display_name":"Minimax","score":0.9361629486083984},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.6723877787590027},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6716850996017456},{"id":"https://openalex.org/keywords/minimax-approximation-algorithm","display_name":"Minimax approximation algorithm","score":0.5744509696960449},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5561712384223938},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5512229204177856},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5016806125640869},{"id":"https://openalex.org/keywords/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.4222710430622101},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39738035202026367},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3765888810157776},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.342795193195343},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.04651731252670288}],"concepts":[{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.9361629486083984},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.6723877787590027},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6716850996017456},{"id":"https://openalex.org/C117148685","wikidata":"https://www.wikidata.org/wiki/Q6865376","display_name":"Minimax approximation algorithm","level":2,"score":0.5744509696960449},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5561712384223938},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5512229204177856},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5016806125640869},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.4222710430622101},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39738035202026367},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3765888810157776},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.342795193195343},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.04651731252670288},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01498333","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01498333","pdf_url":null,"source":{"id":"https://openalex.org/S126160977","display_name":"Mathematical Methods of Operations Research","issn_l":"1432-2994","issn":["1432-2994","1432-5217"],"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":"ZOR - Methods and Models of Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1669104078","https://openalex.org/W2014252818","https://openalex.org/W2047994867","https://openalex.org/W2080793066"],"related_works":["https://openalex.org/W2007611377","https://openalex.org/W2014708116","https://openalex.org/W2332878920","https://openalex.org/W2085446381","https://openalex.org/W149398686","https://openalex.org/W2014628290","https://openalex.org/W2033135368","https://openalex.org/W2027551339","https://openalex.org/W4313679467","https://openalex.org/W2047800014"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}