{"id":"https://openalex.org/W2021395303","doi":"https://doi.org/10.1016/0167-6377(92)90026-y","title":"On interior algorithms for linear programming with no regularity assumptions","display_name":"On interior algorithms for linear programming with no regularity assumptions","publication_year":1992,"publication_date":"1992-05-01","ids":{"openalex":"https://openalex.org/W2021395303","doi":"https://doi.org/10.1016/0167-6377(92)90026-y","mag":"2021395303"},"language":"en","primary_location":{"id":"doi:10.1016/0167-6377(92)90026-y","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-6377(92)90026-y","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"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":"Operations Research 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/A5053103458","display_name":"Kurt M. Anstreicher","orcid":"https://orcid.org/0000-0002-6306-9940"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]},{"id":"https://openalex.org/I4210155590","display_name":"Management Sciences (United States)","ror":"https://ror.org/05shz5j84","country_code":"US","type":"company","lineage":["https://openalex.org/I4210155590"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kurt M Anstreicher","raw_affiliation_strings":["Department of Management Sciences, University of Iowa, Iowa City, IA USA","Department of Management Sciences, University of Iowa, Iowa City, IA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Management Sciences, University of Iowa, Iowa City, IA USA","institution_ids":["https://openalex.org/I126307644","https://openalex.org/I4210155590"]},{"raw_affiliation_string":"Department of Management Sciences, University of Iowa, Iowa City, IA, USA","institution_ids":["https://openalex.org/I126307644","https://openalex.org/I4210155590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053103458"],"corresponding_institution_ids":["https://openalex.org/I126307644","https://openalex.org/I4210155590"],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":null,"fwci":1.4868,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.81222222,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"11","issue":"4","first_page":"209","last_page":"212"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"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/T12288","display_name":"Optimization and Search Problems","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/linear-programming","display_name":"Linear programming","score":0.8239784836769104},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.7548913359642029},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6531590819358826},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5082735419273376},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.5014028549194336},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44709768891334534},{"id":"https://openalex.org/keywords/criss-cross-algorithm","display_name":"Criss-cross algorithm","score":0.4390050172805786},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.41217195987701416},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3838869333267212}],"concepts":[{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.8239784836769104},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.7548913359642029},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6531590819358826},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5082735419273376},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5014028549194336},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44709768891334534},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.4390050172805786},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.41217195987701416},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3838869333267212},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0167-6377(92)90026-y","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-6377(92)90026-y","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"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":"Operations Research 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":17,"referenced_works":["https://openalex.org/W1794576667","https://openalex.org/W1963547452","https://openalex.org/W1964752420","https://openalex.org/W1977916887","https://openalex.org/W1980845317","https://openalex.org/W1985408040","https://openalex.org/W2036622774","https://openalex.org/W2094326251","https://openalex.org/W2599168675","https://openalex.org/W2611147814","https://openalex.org/W3124672200","https://openalex.org/W4298262456","https://openalex.org/W6638128880","https://openalex.org/W6641272113","https://openalex.org/W6646516152","https://openalex.org/W6649504798","https://openalex.org/W6659577397"],"related_works":["https://openalex.org/W4205348974","https://openalex.org/W2784100870","https://openalex.org/W2007464938","https://openalex.org/W2965106131","https://openalex.org/W2337360258","https://openalex.org/W4214624958","https://openalex.org/W2133667137","https://openalex.org/W2114808974","https://openalex.org/W1709621369","https://openalex.org/W2030563458"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}