{"id":"https://openalex.org/W4388319734","doi":"https://doi.org/10.1093/oso/9780198538561.003.0001","title":"Simplex algorithms","display_name":"Simplex algorithms","alternate_titles":[],"publication_year":1996,"publication_date":"1996-09-19","ids":{"openalex":"https://openalex.org/W4388319734","doi":"https://doi.org/10.1093/oso/9780198538561.003.0001"},"language":"en","primary_location":{"id":"doi:10.1093/oso/9780198538561.003.0001","doi":"https://doi.org/10.1093/oso/9780198538561.003.0001","is_oa":false,"landing_page_url":"https://doi.org/10.1093/oso/9780198538561.003.0001","pdf_url":null,"source":{"id":"https://openalex.org/S4306463708","display_name":"Oxford University Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Linear and Integer Programming","raw_type":"book-chapter"},"parent_works":[{"id":"https://openalex.org/W2037099387","display_name":"Advances in Linear and Integer Programming","relationship":"volume"}],"lineage":["https://openalex.org/W4388319734","https://openalex.org/W2037099387"],"child_works_count":0,"type":"book-chapter","is_traditional":true,"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/A5006704213","display_name":"Istv\u00e1n Maros","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Istv\u00e1n Maros","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5108385781","display_name":"Gautam Mitra","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I59433898","display_name":"Brunel University of London","ror":"https://ror.org/00dn4t376","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I59433898"]},{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"government","lineage":["https://openalex.org/I7597260"]}],"countries":["GB","HU"],"is_corresponding":false,"raw_author_name":"Gautam Mitra","raw_affiliation_strings":["Brunel University, Uxbridge UB8 3PH, England","Brunel University, Uxbridge UB8 3PH, England Computer and Automation Institute, Hungarian Academy of Sciences, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brunel University, Uxbridge UB8 3PH, England","institution_ids":["https://openalex.org/I59433898"]},{"raw_affiliation_string":"Brunel University, Uxbridge UB8 3PH, England Computer and Automation Institute, Hungarian Academy of Sciences, Budapest, Hungary","institution_ids":["https://openalex.org/I7597260"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.2442,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.88824503,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"46"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8633000254631042,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8633000254631042,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.11879999935626984,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.0038999998942017555,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simplex-method","display_name":"simplex method","score":0.9490000009536743},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.9919999837875366},{"id":"https://openalex.org/keywords/systems-of-linear-inequalities","display_name":"systems of linear inequalities","score":0.8339999914169312},{"id":"https://openalex.org/keywords/dantzig","display_name":"Dantzig","score":0.8330000042915344},{"id":"https://openalex.org/keywords/optimization","display_name":"optimization","score":0.5529999732971191},{"id":"https://openalex.org/keywords/planning-and-scheduling","display_name":"planning and scheduling","score":0.8619999885559082}],"concepts":[{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.8070526123046875},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.7547275424003601},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.5250047445297241},{"id":"https://openalex.org/C115051666","wikidata":"https://www.wikidata.org/wiki/Q6522493","display_name":"Ranging","level":2,"score":0.5060903429985046},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4974344074726105},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.4937637746334076},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.45726168155670166},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.4571916460990906},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42776039242744446},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41773974895477295},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4012267589569092},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.25000709295272827},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1093/oso/9780198538561.003.0001","doi":"https://doi.org/10.1093/oso/9780198538561.003.0001","is_oa":false,"landing_page_url":"https://doi.org/10.1093/oso/9780198538561.003.0001","pdf_url":null,"source":{"id":"https://openalex.org/S4306463708","display_name":"Oxford University Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Linear and Integer Programming","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4300591249","https://openalex.org/W7095297922","https://openalex.org/W3117425211","https://openalex.org/W2041443873","https://openalex.org/W4249273055","https://openalex.org/W2157104063","https://openalex.org/W1567794523","https://openalex.org/W4214621039","https://openalex.org/W4253848241","https://openalex.org/W7128779318"],"abstract_inverted_index":{"Abstract":[0],"Linear":[1],"inequality":[2],"systems":[3],"were":[4],"studied":[5],"by":[6],"Fourier,":[7],"Motzkin":[8],"and":[9,27,48,55],"Farkas":[10],"(see":[11],"[14])":[12],"but":[13],"only":[14],"in":[15,24,29,52],"the":[16,20,25,30,60,65,70,113],"late":[17],"1940s":[18],"did":[19],"work":[21],"of":[22,46,74,87,115],"Dantzig":[23,58],"USA":[26],"Kantorovich":[28],"former":[31],"USSR":[32],"make":[33],"linear":[34,76,80,94],"programming":[35,95],"a":[36,75],"leading":[37],"research":[38],"topic":[39,114],"with":[40],"wide":[41],"ranging":[42],"applications":[43,91],"to":[44,79],"problems":[45],"planning":[47,90],"scheduling":[49],"as":[50,107,109],"found":[51],"business,":[53],"industry":[54],"government":[56],"[14].":[57],"developed":[59],"celebrated":[61],"simplex":[62],"method":[63],"(in":[64],"tableau":[66],"form)":[67],"for":[68],"finding":[69],"maximum":[71],"or":[72],"minimum":[73],"function":[77],"subject":[78],"restrictions.":[81],"The":[82],"resulting":[83],"optimization":[84],"problem":[85],"because":[86],"its":[88],"many":[89],"was":[92],"called":[93],"(LP).":[96],"Since":[97],"that":[98],"time":[99],"there":[100],"has":[101],"been":[102],"considerable":[103],"curiosity":[104],"driven":[105],"research,":[106,111],"well":[108],"applicable":[110],"on":[112],"LP.":[116]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4388319734","counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2023-11-04T00:00:00"}
