{"id":"https://openalex.org/W2211319681","doi":"https://doi.org/10.1145/2822890","title":"Solving Linear Programs without Breaking Abstractions","display_name":"Solving Linear Programs without Breaking Abstractions","publication_year":2015,"publication_date":"2015-12-10","ids":{"openalex":"https://openalex.org/W2211319681","doi":"https://doi.org/10.1145/2822890","mag":"2211319681"},"language":"en","primary_location":{"id":"doi:10.1145/2822890","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2822890","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.repository.cam.ac.uk/bitstreams/d821a1f5-ee43-4324-9e12-4a27ea6b7391/download","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079027478","display_name":"Matthew Anderson","orcid":"https://orcid.org/0000-0001-8747-1187"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Matthew Anderson","raw_affiliation_strings":["University of Cambridge"],"affiliations":[{"raw_affiliation_string":"University of Cambridge","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080843415","display_name":"Anuj Dawar","orcid":"https://orcid.org/0000-0003-4014-8248"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Anuj Dawar","raw_affiliation_strings":["University of Cambridge"],"affiliations":[{"raw_affiliation_string":"University of Cambridge","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045757852","display_name":"Bjarki Holm","orcid":null},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Bjarki Holm","raw_affiliation_strings":["University of Cambridge, Cambridge, UK"],"affiliations":[{"raw_affiliation_string":"University of Cambridge, Cambridge, UK","institution_ids":["https://openalex.org/I241749"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5079027478"],"corresponding_institution_ids":["https://openalex.org/I241749"],"apc_list":null,"apc_paid":null,"fwci":3.633,"has_fulltext":true,"cited_by_count":23,"citation_normalized_percentile":{"value":0.93504375,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"62","issue":"6","first_page":"1","last_page":"26"},"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.9990000128746033,"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.9990000128746033,"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.9987000226974487,"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/T10142","display_name":"Formal Methods in Verification","score":0.9972000122070312,"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/oracle","display_name":"Oracle","score":0.750408411026001},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.555679440498352},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5056498050689697},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5029999613761902},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4867827594280243},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46546411514282227},{"id":"https://openalex.org/keywords/ellipsoid","display_name":"Ellipsoid","score":0.4233900308609009},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35251691937446594},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3461988568305969},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15129035711288452}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.750408411026001},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.555679440498352},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5056498050689697},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5029999613761902},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4867827594280243},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46546411514282227},{"id":"https://openalex.org/C57489055","wikidata":"https://www.wikidata.org/wiki/Q190046","display_name":"Ellipsoid","level":2,"score":0.4233900308609009},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35251691937446594},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3461988568305969},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15129035711288452},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2822890","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2822890","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:www.repository.cam.ac.uk:1810/251099","is_oa":true,"landing_page_url":"https://www.repository.cam.ac.uk/handle/1810/251099","pdf_url":"https://www.repository.cam.ac.uk/bitstreams/d821a1f5-ee43-4324-9e12-4a27ea6b7391/download","source":{"id":"https://openalex.org/S4306401776","display_name":"Apollo (University of Cambridge)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I241749","host_organization_name":"University of Cambridge","host_organization_lineage":["https://openalex.org/I241749"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:www.repository.cam.ac.uk:1810/251099","is_oa":true,"landing_page_url":"https://www.repository.cam.ac.uk/handle/1810/251099","pdf_url":"https://www.repository.cam.ac.uk/bitstreams/d821a1f5-ee43-4324-9e12-4a27ea6b7391/download","source":{"id":"https://openalex.org/S4306401776","display_name":"Apollo (University of Cambridge)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I241749","host_organization_name":"University of Cambridge","host_organization_lineage":["https://openalex.org/I241749"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2470687288","display_name":null,"funder_award_id":"EP/H026835/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3348103018","display_name":null,"funder_award_id":"EP/H026835","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2211319681.pdf","grobid_xml":"https://content.openalex.org/works/W2211319681.grobid-xml"},"referenced_works_count":43,"referenced_works":["https://openalex.org/W51516856","https://openalex.org/W109597122","https://openalex.org/W1482193060","https://openalex.org/W1489366126","https://openalex.org/W1499313444","https://openalex.org/W1507039213","https://openalex.org/W1539402525","https://openalex.org/W1571051474","https://openalex.org/W1856885707","https://openalex.org/W1984890936","https://openalex.org/W1989783863","https://openalex.org/W1993886628","https://openalex.org/W2003813631","https://openalex.org/W2012329067","https://openalex.org/W2025948098","https://openalex.org/W2033040247","https://openalex.org/W2033871299","https://openalex.org/W2034053794","https://openalex.org/W2045027298","https://openalex.org/W2046499385","https://openalex.org/W2047281923","https://openalex.org/W2049143039","https://openalex.org/W2050977796","https://openalex.org/W2076680677","https://openalex.org/W2088094394","https://openalex.org/W2090133546","https://openalex.org/W2100440346","https://openalex.org/W2117313088","https://openalex.org/W2121755852","https://openalex.org/W2123805664","https://openalex.org/W2127470768","https://openalex.org/W2149067455","https://openalex.org/W2181072414","https://openalex.org/W2290968667","https://openalex.org/W2327315803","https://openalex.org/W2406527838","https://openalex.org/W2412657279","https://openalex.org/W2592241421","https://openalex.org/W2611147814","https://openalex.org/W2951495208","https://openalex.org/W2953073252","https://openalex.org/W4205863090","https://openalex.org/W4236835455"],"related_works":["https://openalex.org/W2474469336","https://openalex.org/W2391431582","https://openalex.org/W2374451721","https://openalex.org/W2029213262","https://openalex.org/W2351198180","https://openalex.org/W2360118089","https://openalex.org/W2391391696","https://openalex.org/W2365093105","https://openalex.org/W2371931285","https://openalex.org/W2163020700"],"abstract_inverted_index":{"We":[0,97],"show":[1,101],"that":[2,16,37,65,91,102],"the":[3,18,21,35,49,59,66,83,103,133,142],"ellipsoid":[4],"method":[5,36],"for":[6,141],"solving":[7],"linear":[8,69],"programs":[9,70],"can":[10,71],"be":[11,72],"implemented":[12],"in":[13,48,74,95,109,114,157],"a":[14,88,106,110,137],"way":[15,134],"respects":[17],"symmetry":[19],"of":[20,34,68,105],"program":[22,50,84],"being":[23],"solved.":[24],"That":[25],"is":[26,30,85,92,112],"to":[27,100,135],"say,":[28],"there":[29],"an":[31,118],"algorithmic":[32],"implementation":[33],"does":[38],"not":[39],"distinguish,":[40],"or":[41,46],"make":[42],"choices,":[43],"between":[44],"variables":[45],"constraints":[47],"unless":[51],"they":[52],"are":[53],"distinguished":[54],"by":[55,87,123],"properties":[56],"definable":[57,94,113],"from":[58],"program.":[60],"In":[61],"particular,":[62],"we":[63,146],"demonstrate":[64],"solvability":[67],"expressed":[73],"fixed-point":[75],"logic":[76],"with":[77],"counting":[78],"(FPC)":[79],"as":[80,82],"long":[81],"given":[86],"separation":[89,139],"oracle":[90,140],"itself":[93],"FPC.":[96,115],"use":[98],"this":[99],"size":[104],"maximum":[107,143,152],"matching":[108,144],"graph":[111],"This":[116],"settles":[117],"open":[119],"problem":[120],"first":[121],"posed":[122],"Blass,":[124],"Gurevich":[125],"and":[126,154],"Shelah":[127],"[Blass":[128],"et":[129],"al.":[130],"1999].":[131],"On":[132],"defining":[136,150],"suitable":[138],"program,":[145],"provide":[147],"FPC":[148],"formulas":[149],"canonical":[151],"flows":[153],"minimum":[155],"cuts":[156],"undirected":[158],"capacitated":[159],"graphs.":[160]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}