{"id":"https://openalex.org/W2293098548","doi":"https://doi.org/10.1016/b978-0-12-545075-1.50009-2","title":"Polynomial Algorithms\u2014Linear Programming","display_name":"Polynomial Algorithms\u2014Linear Programming","alternate_titles":[],"publication_year":1988,"publication_date":"1988-01-01","ids":{"openalex":"https://openalex.org/W2293098548","doi":"https://doi.org/10.1016/b978-0-12-545075-1.50009-2","mag":"2293098548"},"language":"en","primary_location":{"id":"doi:10.1016/b978-0-12-545075-1.50009-2","doi":"https://doi.org/10.1016/b978-0-12-545075-1.50009-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/b978-0-12-545075-1.50009-2","pdf_url":null,"source":{"id":"https://openalex.org/S4306463230","display_name":"Elsevier eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Optimization","raw_type":"book-chapter"},"parent_works":[{"id":"https://openalex.org/W4253763844","display_name":"Discrete Optimization","relationship":"volume"}],"lineage":["https://openalex.org/W2293098548","https://openalex.org/W4253763844"],"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/A5027572774","display_name":"Robert Parker","orcid":"https://orcid.org/0000-0002-6578-7401","observed_orcids":["https://orcid.org/0000-0002-6578-7401"]},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Gary Parker","raw_affiliation_strings":["School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114258405","display_name":"Ronald L. Rardin","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ronald L. Rardin","raw_affiliation_strings":["School of Industrial Engineering, Purdue University, West Lafayette, Indiana"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial Engineering, Purdue University, West Lafayette, Indiana","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"107","last_page":"156"},"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.9740999937057495,"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.9740999937057495,"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.024700000882148743,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.0003000000142492354,"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/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.7739999890327454},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.9919999837875366},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"simplex algorithm","score":0.9679999947547913},{"id":"https://openalex.org/keywords/ellipsoid-algorithm","display_name":"ellipsoid algorithm","score":0.7979999780654907},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.7900000214576721},{"id":"https://openalex.org/keywords/worst-case-complexity","display_name":"worst-case complexity","score":0.7269999980926514},{"id":"https://openalex.org/keywords/exponential-time-complexity","display_name":"exponential complexity","score":0.6420000195503235},{"id":"https://openalex.org/keywords/extreme-points","display_name":"extreme points","score":0.7839999794960022}],"concepts":[{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.862768292427063},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.8252041935920715},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7873606085777283},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.7568029165267944},{"id":"https://openalex.org/C191157680","wikidata":"https://www.wikidata.org/wiki/Q17085895","display_name":"Revised simplex method","level":4,"score":0.6405978202819824},{"id":"https://openalex.org/C39847760","wikidata":"https://www.wikidata.org/wiki/Q1385465","display_name":"Extreme point","level":2,"score":0.6387338638305664},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6300796270370483},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5097302794456482},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.49881887435913086},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.4911637008190155},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4904922842979431},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42551594972610474},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.41200491786003113},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2497158944606781},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0743769109249115},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06375536322593689}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/b978-0-12-545075-1.50009-2","doi":"https://doi.org/10.1016/b978-0-12-545075-1.50009-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/b978-0-12-545075-1.50009-2","pdf_url":null,"source":{"id":"https://openalex.org/S4306463230","display_name":"Elsevier eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Optimization","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/W129418716","https://openalex.org/W3112915124","https://openalex.org/W2072478883","https://openalex.org/W1501168133","https://openalex.org/W4247047926","https://openalex.org/W71992527","https://openalex.org/W4247247809","https://openalex.org/W36359157","https://openalex.org/W1975675936","https://openalex.org/W2017177415"],"abstract_inverted_index":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2293098548","counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
