{"id":"https://openalex.org/W2009436609","doi":"https://doi.org/10.1016/0020-0190(86)90037-2","title":"Linear programming in O(n \u00d7 3d) time","display_name":"Linear programming in O(n \u00d7 3d) time","publication_year":1986,"publication_date":"1986-01-01","ids":{"openalex":"https://openalex.org/W2009436609","doi":"https://doi.org/10.1016/0020-0190(86)90037-2","mag":"2009436609"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(86)90037-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(86)90037-2","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5047290568","display_name":"Kenneth L. Clarkson","orcid":null},"institutions":[{"id":"https://openalex.org/I73544541","display_name":"Mathematical Sciences Research Institute","ror":"https://ror.org/05hs5r386","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I73544541"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kenneth L. Clarkson","raw_affiliation_strings":["AT&T Bell Laboratories, Murray Hill, NJ 07974, U.S.A","Present affiliation: Computer Science Department, Stanford University, Stanford, CA 94305, U.S.A"],"affiliations":[{"raw_affiliation_string":"AT&T Bell Laboratories, Murray Hill, NJ 07974, U.S.A","institution_ids":["https://openalex.org/I73544541"]},{"raw_affiliation_string":"Present affiliation: Computer Science Department, Stanford University, Stanford, CA 94305, U.S.A","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5047290568"],"corresponding_institution_ids":["https://openalex.org/I73544541"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":6.8459,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.95977011,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"22","issue":"1","first_page":"21","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.7928000092506409,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.7928000092506409,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.7699999809265137,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.7113999724388123,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/interdiction","display_name":"Interdiction","score":0.9273730516433716},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8305194973945618},{"id":"https://openalex.org/keywords/bilevel-optimization","display_name":"Bilevel optimization","score":0.6984552145004272},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6837742328643799},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5992535948753357},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.5757629871368408},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5513541102409363},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5260560512542725},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.49828100204467773},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4555765688419342},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42008352279663086},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4145898222923279},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3484961688518524},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3339387774467468}],"concepts":[{"id":"https://openalex.org/C124119293","wikidata":"https://www.wikidata.org/wiki/Q6046081","display_name":"Interdiction","level":2,"score":0.9273730516433716},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8305194973945618},{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.6984552145004272},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6837742328643799},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5992535948753357},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.5757629871368408},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5513541102409363},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5260560512542725},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.49828100204467773},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4555765688419342},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42008352279663086},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4145898222923279},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3484961688518524},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3339387774467468},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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.1016/0020-0190(86)90037-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(86)90037-2","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/W1993058867","https://openalex.org/W2040783379","https://openalex.org/W2611147814","https://openalex.org/W6669647044"],"related_works":["https://openalex.org/W246960280","https://openalex.org/W2087209118","https://openalex.org/W2168163332","https://openalex.org/W179363847","https://openalex.org/W2381035939","https://openalex.org/W2005493932","https://openalex.org/W2378557713","https://openalex.org/W2141701778","https://openalex.org/W3169691842","https://openalex.org/W2319807324"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}