{"id":"https://openalex.org/W2089329646","doi":"https://doi.org/10.1016/s0167-6377(00)00059-6","title":"Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks","display_name":"Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks","publication_year":2000,"publication_date":"2000-12-01","ids":{"openalex":"https://openalex.org/W2089329646","doi":"https://doi.org/10.1016/s0167-6377(00)00059-6","mag":"2089329646"},"language":"en","primary_location":{"id":"doi:10.1016/s0167-6377(00)00059-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-6377(00)00059-6","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/A5079981879","display_name":"S. Thomas McCormick","orcid":"https://orcid.org/0000-0002-2828-4100"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"S.Thomas McCormick","raw_affiliation_strings":["Faculty of Commerce and Business Administration, University of British Columbia, Vancouver, BC, Canada V6T 1Z2"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Commerce and Business Administration, University of British Columbia, Vancouver, BC, Canada V6T 1Z2","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067169957","display_name":"Akiyoshi Shioura","orcid":"https://orcid.org/0000-0002-5216-7190"},"institutions":[{"id":"https://openalex.org/I42999171","display_name":"Sophia University","ror":"https://ror.org/01nckkm68","country_code":"JP","type":"education","lineage":["https://openalex.org/I42999171"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Akiyoshi Shioura","raw_affiliation_strings":["Department of Mechanical Engineering, Sophia University, 7-1 Kioi-cho, Chiyoda-ku, Tokyo 102-8554, Japan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Sophia University, 7-1 Kioi-cho, Chiyoda-ku, Tokyo 102-8554, Japan#TAB#","institution_ids":["https://openalex.org/I42999171"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":null,"fwci":1.8618,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.86023593,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"27","issue":"5","first_page":"199","last_page":"207"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9977999925613403,"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.9973000288009644,"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/unimodular-matrix","display_name":"Unimodular matrix","score":0.6610368490219116},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.643317699432373},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6276452541351318},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.566646933555603},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5189521312713623},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5147164463996887},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47666409611701965},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45414212346076965},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.42737269401550293},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.350441575050354},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3367330729961395},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3074347674846649}],"concepts":[{"id":"https://openalex.org/C201958917","wikidata":"https://www.wikidata.org/wiki/Q1367055","display_name":"Unimodular matrix","level":2,"score":0.6610368490219116},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.643317699432373},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6276452541351318},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.566646933555603},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5189521312713623},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5147164463996887},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47666409611701965},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45414212346076965},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.42737269401550293},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.350441575050354},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3367330729961395},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3074347674846649},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0167-6377(00)00059-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-6377(00)00059-6","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W569270505","https://openalex.org/W1963547452","https://openalex.org/W1967030975","https://openalex.org/W1975387839","https://openalex.org/W1977545325","https://openalex.org/W1993305973","https://openalex.org/W2006228567","https://openalex.org/W2018732369","https://openalex.org/W2046715803","https://openalex.org/W2047001449","https://openalex.org/W2048790997","https://openalex.org/W2060088365","https://openalex.org/W2066087428","https://openalex.org/W2087970026","https://openalex.org/W2090359754","https://openalex.org/W2097004206","https://openalex.org/W2099463627","https://openalex.org/W2100440346","https://openalex.org/W2103985627","https://openalex.org/W2155370486","https://openalex.org/W2165142526","https://openalex.org/W2166541787","https://openalex.org/W2480247681","https://openalex.org/W2571014755","https://openalex.org/W4213060235","https://openalex.org/W4233558979","https://openalex.org/W4300645277","https://openalex.org/W6721564792"],"related_works":["https://openalex.org/W2011745869","https://openalex.org/W2088028898","https://openalex.org/W1974942973","https://openalex.org/W2950905816","https://openalex.org/W1985869163","https://openalex.org/W2380451491","https://openalex.org/W2504687579","https://openalex.org/W4390575969","https://openalex.org/W2107423006","https://openalex.org/W1774334694"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}