{"id":"https://openalex.org/W2975390769","doi":"https://doi.org/10.1137/21m1419994","title":"Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization","display_name":"Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization","publication_year":2022,"publication_date":"2022-08-30","ids":{"openalex":"https://openalex.org/W2975390769","doi":"https://doi.org/10.1137/21m1419994","mag":"2975390769"},"language":"en","primary_location":{"id":"doi:10.1137/21m1419994","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1419994","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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/A5055755657","display_name":"Jes\u00fas A. De Loera","orcid":"https://orcid.org/0000-0002-9556-1112"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jes\u00fas A. De Loera","raw_affiliation_strings":["University of California, Davis, USA"],"raw_orcid":"https://orcid.org/0000-0002-9556-1112","affiliations":[{"raw_affiliation_string":"University of California, Davis, USA","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039806750","display_name":"Sean Kafer","orcid":"https://orcid.org/0000-0002-0779-6801"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Sean Kafer","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051955401","display_name":"Laura Sanit\u00e0","orcid":"https://orcid.org/0000-0002-6384-1857"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Laura Sanit\u00e0","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.164,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.94267516,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"32","issue":"3","first_page":"2156","last_page":"2179"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9980000257492065,"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.9980000257492065,"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.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/T10374","display_name":"Advanced Graph Theory Research","score":0.9891999959945679,"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/polyhedron","display_name":"Polyhedron","score":0.8994157314300537},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.739439845085144},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6711555123329163},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6200843453407288},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.5757296085357666},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.5729180574417114},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5650339126586914},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5381314158439636},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.536399245262146},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.48260581493377686},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4705907106399536},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4460853636264801},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4117133915424347},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37478601932525635},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21667850017547607},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21434688568115234},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07974812388420105}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.8994157314300537},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.739439845085144},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6711555123329163},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6200843453407288},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.5757296085357666},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.5729180574417114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5650339126586914},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5381314158439636},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.536399245262146},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.48260581493377686},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4705907106399536},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4460853636264801},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4117133915424347},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37478601932525635},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21667850017547607},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21434688568115234},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07974812388420105},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/21m1419994","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1419994","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3355331909","display_name":null,"funder_award_id":"1818969","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G408868665","display_name":null,"funder_award_id":"VI.Vidi.193.087","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G565295993","display_name":null,"funder_award_id":"CCF-1934568","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7096521375","display_name":null,"funder_award_id":"DMS-1818969","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W23064316","https://openalex.org/W215256906","https://openalex.org/W1503025934","https://openalex.org/W1528072933","https://openalex.org/W1571051474","https://openalex.org/W1852734164","https://openalex.org/W1873370420","https://openalex.org/W1935571660","https://openalex.org/W1956277787","https://openalex.org/W1969119890","https://openalex.org/W1983610891","https://openalex.org/W1986414193","https://openalex.org/W2010362899","https://openalex.org/W2040464112","https://openalex.org/W2044618353","https://openalex.org/W2046715803","https://openalex.org/W2047001449","https://openalex.org/W2061874298","https://openalex.org/W2061915487","https://openalex.org/W2079737176","https://openalex.org/W2080654168","https://openalex.org/W2081659888","https://openalex.org/W2089329646","https://openalex.org/W2090960684","https://openalex.org/W2102913539","https://openalex.org/W2109237987","https://openalex.org/W2123640521","https://openalex.org/W2133159317","https://openalex.org/W2137614705","https://openalex.org/W2338905098","https://openalex.org/W2496050505","https://openalex.org/W2757042684","https://openalex.org/W2804559392","https://openalex.org/W2962713740","https://openalex.org/W2962838697","https://openalex.org/W2963404973","https://openalex.org/W2963717743","https://openalex.org/W2964045245","https://openalex.org/W2969997982","https://openalex.org/W2995351680","https://openalex.org/W3139496137"],"related_works":["https://openalex.org/W73031078","https://openalex.org/W1642182499","https://openalex.org/W4286870264","https://openalex.org/W2279275934","https://openalex.org/W4304687059","https://openalex.org/W4242784854","https://openalex.org/W2185826091","https://openalex.org/W2048470382","https://openalex.org/W2477407501","https://openalex.org/W2384679317"],"abstract_inverted_index":{"Circuit-augmentation":[0],"algorithms":[1],"are":[2,48],"generalizations":[3],"of":[4,21,29,32,72,92,97,105,114,127,150,164,191,211,234],"the":[5,30,39,42,54,66,70,103,108,112,124,139,147,157,161,170,181,200,209],"simplex":[6,109,183],"method,":[7,110],"where":[8],"in":[9,38,62,65,107,146,154],"each":[10],"step":[11],"one":[12],"is":[13,26,85,141,153,214],"allowed":[14],"to":[15,76,82,123,176,204,218],"move":[16],"along":[17],"a":[18,27,33,100,120,144,189,212,221,231],"fixed":[19],"set":[20],"directions,":[22],"called":[23],"circuits,":[24],"that":[25,37,134,169,197],"superset":[28],"edges":[31],"polytope.":[34],"We":[35],"show":[36,133,168],"circuit-augmentation":[40,171],"framework":[41,172],"greatest-improvement":[43],"and":[44,69,111,216,226],"Dantzig":[45],"pivot":[46,56],"rules":[47],"NP-hard,":[49,215],"already":[50],"for":[51,88,102,135,160,228],"0/1-LPs.":[52,89],"Differently,":[53],"steepest-descent":[55],"rule":[57,84],"can":[58,173,238],"be":[59,174,239],"carried":[60],"out":[61],"polynomial":[63,87,145,236],"time":[64],"0/1":[67],"setting,":[68],"number":[71,91,104],"circuit":[73,93,193],"augmentations":[74,94],"required":[75],"reach":[77],"an":[78,205],"optimal":[79,206],"solution":[80,207],"according":[81],"this":[83],"strongly":[86,235],"The":[90],"has":[95,116],"been":[96,117],"interest":[98],"as":[99,119,188],"proxy":[101],"steps":[106],"circuit-diameter":[113,140],"polyhedra":[115],"studied":[118],"lower":[121],"bound":[122],"combinatorial":[125,162],"diameter":[126,163],"polyhedra.":[128,165],"Extending":[129],"prior":[130],"results,":[131,194],"we":[132,167,195],"any":[136],"polyhedron":[137],"$P$":[138],"bounded":[142],"by":[143],"input":[148],"bit-size":[149],"$P$.":[151],"This":[152],"contrast":[155],"with":[156],"best":[158],"bounds":[159],"Interestingly,":[166],"exploited":[175],"make":[177],"novel":[178],"conclusions":[179],"about":[180],"classical":[182],"method":[184],"itself:":[185],"In":[186],"particular,":[187],"byproduct":[190],"our":[192],"prove":[196],"(i)":[198],"computing":[199],"shortest":[201],"(monotone)":[202],"path":[203,233],"on":[208],"1-skeleton":[210],"polytope":[213],"hard":[217],"approximate":[219],"within":[220],"factor":[222],"better":[223],"than":[224],"2,":[225],"(ii)":[227],"$0/1$":[229],"polytopes,":[230],"monotone":[232],"length":[237],"constructed":[240],"using":[241],"steepest":[242],"improving":[243],"edges.":[244]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}