{"id":"https://openalex.org/W1998919258","doi":"https://doi.org/10.1145/62212.62232","title":"Expressing combinatorial optimization problems by linear programs","display_name":"Expressing combinatorial optimization problems by linear programs","publication_year":1988,"publication_date":"1988-01-01","ids":{"openalex":"https://openalex.org/W1998919258","doi":"https://doi.org/10.1145/62212.62232","mag":"1998919258"},"language":"en","primary_location":{"id":"doi:10.1145/62212.62232","doi":"https://doi.org/10.1145/62212.62232","is_oa":false,"landing_page_url":"https://doi.org/10.1145/62212.62232","pdf_url":null,"source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5043084405","display_name":"Mihalis Yannakakis","orcid":"https://orcid.org/0000-0003-2857-1860","observed_orcids":["https://orcid.org/0000-0003-2857-1860"]},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mihalis Yannakakis","raw_affiliation_strings":["AT&T Bell Labs.,Murray Hill, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Bell Labs.,Murray Hill, NJ","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5043084405"],"corresponding_institution_ids":["https://openalex.org/I1283103587"],"apc_list":null,"apc_paid":null,"fwci":3.7241,"has_fulltext":false,"cited_by_count":109,"citation_normalized_percentile":{"value":0.92277992,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"223","last_page":"228"},"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.9994999766349792,"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.9994999766349792,"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.00039999998989515007,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":9.999999747378752e-05,"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/linear-programming-formulation","display_name":"linear programming formulation","score":0.7429999709129333},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8109999895095825},{"id":"https://openalex.org/keywords/polytopes","display_name":"polytopes","score":0.8029999732971191},{"id":"https://openalex.org/keywords/matching-polytope","display_name":"matching polytope","score":0.8140000104904175},{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.9750000238418579},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"communication complexity","score":0.6710000038146973},{"id":"https://openalex.org/keywords/exponential-lower-bounds","display_name":"exponential lower bounds","score":0.5659999847412109}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5802712440490723},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5191940069198608},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3802434802055359},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26791760325431824},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24054506421089172}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/62212.62232","doi":"https://doi.org/10.1145/62212.62232","is_oa":false,"landing_page_url":"https://doi.org/10.1145/62212.62232","pdf_url":null,"source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1541044338","https://openalex.org/W1574165457","https://openalex.org/W1655990431","https://openalex.org/W1963547452","https://openalex.org/W1994799860","https://openalex.org/W1997315904","https://openalex.org/W2002501531","https://openalex.org/W2012329067","https://openalex.org/W2023521867","https://openalex.org/W2030087828","https://openalex.org/W2033040247","https://openalex.org/W2051170661","https://openalex.org/W2057672746","https://openalex.org/W2060972166","https://openalex.org/W2090133546","https://openalex.org/W2093454413","https://openalex.org/W2123805664","https://openalex.org/W2143474538","https://openalex.org/W2158505527","https://openalex.org/W2296545821","https://openalex.org/W2327315803","https://openalex.org/W2611147814","https://openalex.org/W3139666781"],"related_works":["https://openalex.org/W1755753347","https://openalex.org/W87237596","https://openalex.org/W2119368733","https://openalex.org/W2963516964","https://openalex.org/W2336495812","https://openalex.org/W2619966450","https://openalex.org/W2033871299","https://openalex.org/W2188441431","https://openalex.org/W2119874352","https://openalex.org/W2527923262"],"abstract_inverted_index":{"Many":[0],"combinatorial":[1,78],"optimization":[2,7],"problems":[3],"call":[4],"for":[5,94],"the":[6,27,48,51,65,90],"of":[8,23,29,97],"a":[9,13,56,70,74,77],"linear":[10,32,58],"function":[11],"over":[12],"certain":[14],"polytope.":[15],"Typically,":[16],"these":[17],"polytopes":[18],"have":[19],"an":[20],"exponential":[21,61],"number":[22],"facets.":[24],"We":[25,44,63],"explore":[26],"problem":[28],"finding":[30],"small":[31],"programming":[33],"formulations":[34],"when":[35],"one":[36],"may":[37],"use":[38],"any":[39],"new":[40],"variables":[41],"and":[42,50,88],"constraints.":[43],"show":[45],"that":[46],"expressing":[47],"matching":[49],"Traveling":[52],"Salesman":[53],"Problem":[54],"by":[55,69],"symmetric":[57],"program":[59],"requires":[60],"size.":[62],"relate":[64],"minimum":[66],"size":[67],"needed":[68],"LP":[71],"to":[72,76],"express":[73],"polytope":[75,93],"parameter,":[79],"point":[80],"out":[81],"some":[82,95],"connections":[83],"with":[84],"communication":[85],"complexity":[86],"theory,":[87],"examine":[89],"vertex":[91],"packing":[92],"classes":[96],"graphs.":[98]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":5}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}