{"id":"https://openalex.org/W2018198126","doi":"https://doi.org/10.1137/0211053","title":"On Linear Characterizations of Combinatorial Optimization Problems","display_name":"On Linear Characterizations of Combinatorial Optimization Problems","publication_year":1982,"publication_date":"1982-11-01","ids":{"openalex":"https://openalex.org/W2018198126","doi":"https://doi.org/10.1137/0211053","mag":"2018198126"},"language":"en","primary_location":{"id":"doi:10.1137/0211053","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0211053","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/123456789/22159","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068875104","display_name":"Richard M. Karp","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Richard M. Karp","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5103200572","display_name":"Christos H. Papadimitriou","orcid":"https://orcid.org/0009-0000-7264-8015"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christos H. Papadimitriou","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068875104"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.7657,"has_fulltext":false,"cited_by_count":158,"citation_normalized_percentile":{"value":0.96100917,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"11","issue":"4","first_page":"620","last_page":"632"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9973000288009644,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.7170788049697876},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6557884216308594},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6431097984313965},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.6315934062004089},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5565688014030457},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5436593294143677},{"id":"https://openalex.org/keywords/ellipsoid-method","display_name":"Ellipsoid method","score":0.5387014746665955},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.46872270107269287},{"id":"https://openalex.org/keywords/linear-inequality","display_name":"Linear inequality","score":0.44342130422592163},{"id":"https://openalex.org/keywords/ellipsoid","display_name":"Ellipsoid","score":0.4357638955116272},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.43151798844337463},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.41837409138679504},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.393919974565506},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38076481223106384},{"id":"https://openalex.org/keywords/inequality","display_name":"Inequality","score":0.28690603375434875},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.09810468554496765},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.0784185528755188}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.7170788049697876},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6557884216308594},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6431097984313965},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.6315934062004089},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5565688014030457},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5436593294143677},{"id":"https://openalex.org/C205451395","wikidata":"https://www.wikidata.org/wiki/Q378574","display_name":"Ellipsoid method","level":5,"score":0.5387014746665955},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.46872270107269287},{"id":"https://openalex.org/C84135550","wikidata":"https://www.wikidata.org/wiki/Q3154022","display_name":"Linear inequality","level":3,"score":0.44342130422592163},{"id":"https://openalex.org/C57489055","wikidata":"https://www.wikidata.org/wiki/Q190046","display_name":"Ellipsoid","level":2,"score":0.4357638955116272},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.43151798844337463},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.41837409138679504},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.393919974565506},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38076481223106384},{"id":"https://openalex.org/C45555294","wikidata":"https://www.wikidata.org/wiki/Q28113351","display_name":"Inequality","level":2,"score":0.28690603375434875},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.09810468554496765},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.0784185528755188},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/0211053","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0211053","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},{"id":"pmh:oai:dspace.lib.ntua.gr:123456789/22159","is_oa":true,"landing_page_url":"http://hdl.handle.net/123456789/22159","pdf_url":null,"source":{"id":"https://openalex.org/S4377196837","display_name":"DSpace - NTUA (National Technical University of Athens)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I174458059","host_organization_name":"National Technical University of Athens","host_organization_lineage":["https://openalex.org/I174458059"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM JOURNAL ON COMPUTING","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/148981","is_oa":false,"landing_page_url":"https://hdl.handle.net/1721.1/148981","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:dspace.lib.ntua.gr:123456789/22159","is_oa":true,"landing_page_url":"http://hdl.handle.net/123456789/22159","pdf_url":null,"source":{"id":"https://openalex.org/S4377196837","display_name":"DSpace - NTUA (National Technical University of Athens)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I174458059","host_organization_name":"National Technical University of Athens","host_organization_lineage":["https://openalex.org/I174458059"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM JOURNAL ON COMPUTING","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.6100000143051147,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W42326245","https://openalex.org/W1540760152","https://openalex.org/W1973458874","https://openalex.org/W2006934540","https://openalex.org/W2012329067","https://openalex.org/W2033662447","https://openalex.org/W2052763589","https://openalex.org/W2055569927","https://openalex.org/W2064366623","https://openalex.org/W2069323107","https://openalex.org/W2072789827","https://openalex.org/W2075339720","https://openalex.org/W2103658959","https://openalex.org/W2123805664","https://openalex.org/W2124452917","https://openalex.org/W2327315803","https://openalex.org/W2399100674","https://openalex.org/W2400401042","https://openalex.org/W4233756358"],"related_works":["https://openalex.org/W2979455991","https://openalex.org/W1597047434","https://openalex.org/W1963547452","https://openalex.org/W1975675936","https://openalex.org/W1437939261","https://openalex.org/W2214739880","https://openalex.org/W2990947859","https://openalex.org/W3199970951","https://openalex.org/W2095761776","https://openalex.org/W2018198126"],"abstract_inverted_index":{"We":[0,30],"show":[1,40],"that":[2,41],"there":[3],"can":[4],"be":[5],"no":[6],"computationally":[7],"tractable":[8],"description":[9],"by":[10],"linear":[11,37],"inequalities":[12],"of":[13,60],"the":[14,33],"polyhedron":[15],"associated":[16],"with":[17],"any":[18],"NP-complete":[19],"combinatorial":[20,43],"optimization":[21,44],"problem":[22,45],"unless":[23],"NP":[24],"=":[25],"co-NP\u2014a":[26],"very":[27],"unlikely":[28],"event.":[29],"also":[31],"apply":[32],"ellipsoid":[34],"method":[35],"for":[36],"programming":[38],"to":[39],"a":[42,57],"is":[46],"solvable":[47],"in":[48],"polynomial":[49],"time":[50],"if":[51,54],"and":[52],"only":[53],"it":[55],"admits":[56],"small":[58],"generator":[59],"violated":[61],"inequalities.":[62]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":18},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}