{"id":"https://openalex.org/W2015084469","doi":"https://doi.org/10.1137/070697409","title":"Polyhedral Results for 1-Restricted Simple 2-Matchings","display_name":"Polyhedral Results for 1-Restricted Simple 2-Matchings","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2015084469","doi":"https://doi.org/10.1137/070697409","mag":"2015084469"},"language":"en","primary_location":{"id":"doi:10.1137/070697409","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070697409","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/A5079559219","display_name":"David Hartvigsen","orcid":"https://orcid.org/0000-0001-8353-5577"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David Hartvigsen","raw_affiliation_strings":["David.Hartvigsen.1@nd.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"David.Hartvigsen.1@nd.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100382119","display_name":"Yanjun Li","orcid":"https://orcid.org/0000-0002-6277-4189"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yanjun Li","raw_affiliation_strings":["[email\u00a0protected]#TAB#"],"affiliations":[{"raw_affiliation_string":"[email\u00a0protected]#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079559219"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07774037,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":"3","first_page":"1131","last_page":"1149"},"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.998199999332428,"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.998199999332428,"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.9980999827384949,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9970999956130981,"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/mathematics","display_name":"Mathematics","score":0.7932472229003906},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.71396803855896},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6812949180603027},{"id":"https://openalex.org/keywords/extreme-point","display_name":"Extreme point","score":0.6569284796714783},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6250195503234863},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6077795624732971},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5835779309272766},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.5560773015022278},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5513253211975098},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.5046418905258179},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48604947328567505},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.48129454255104065},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4604971408843994},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4217844009399414},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.36342424154281616},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32484525442123413}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7932472229003906},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.71396803855896},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6812949180603027},{"id":"https://openalex.org/C39847760","wikidata":"https://www.wikidata.org/wiki/Q1385465","display_name":"Extreme point","level":2,"score":0.6569284796714783},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6250195503234863},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6077795624732971},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5835779309272766},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.5560773015022278},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5513253211975098},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.5046418905258179},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48604947328567505},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.48129454255104065},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4604971408843994},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4217844009399414},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.36342424154281616},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32484525442123413},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/070697409","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070697409","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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1516152095","https://openalex.org/W1963596676","https://openalex.org/W1973995785","https://openalex.org/W1978451969","https://openalex.org/W1996962956","https://openalex.org/W2037953913","https://openalex.org/W2092483998","https://openalex.org/W2103985627","https://openalex.org/W2155466993","https://openalex.org/W2172285784","https://openalex.org/W2327315803","https://openalex.org/W4237105209","https://openalex.org/W4256731050"],"related_works":["https://openalex.org/W1509031531","https://openalex.org/W2169525491","https://openalex.org/W1983625635","https://openalex.org/W4287251263","https://openalex.org/W2481372743","https://openalex.org/W4306168826","https://openalex.org/W2023242492","https://openalex.org/W2109026705","https://openalex.org/W2015084469","https://openalex.org/W3150120948"],"abstract_inverted_index":{"A":[0,17,114],"simple":[1,18,44,123],"2-matching":[2,19],"in":[3,95],"a":[4,7,48,101],"graph":[5],"is":[6,20,47,125],"subgraph":[8],"whose":[9],"connected":[10,25],"components":[11],"are":[12],"nontrivial":[13],"paths":[14],"and":[15,73],"cycles.":[16],"called":[21],"1-restricted":[22,43,122],"if":[23],"each":[24],"component":[26],"has":[27,83],"two":[28],"or":[29],"more":[30],"edges.":[31],"In":[32],"this":[33,62],"paper":[34],"we":[35],"consider":[36],"the":[37,51,65,69,75,79,109,118],"problem":[38],"of":[39,50,68,104,117,121],"finding":[40],"maximum":[41],"weight":[42],"2-matchings":[45,124],"(which":[46],"relaxation":[49,82],"traveling":[52],"salesman":[53],"problem).":[54],"We":[55,88,98],"present":[56],"an":[57],"integer":[58],"programming":[59,71,81,112],"formulation":[60],"for":[61,77],"problem,":[63],"characterize":[64,74],"extreme":[66,86],"points":[67],"linear":[70,80,111],"relaxation,":[72],"graphs":[76,94],"which":[78],"all":[84],"integral":[85],"points.":[87],"show":[89],"how":[90],"to":[91],"recognize":[92],"these":[93],"polynomial":[96],"time.":[97],"also":[99],"introduce":[100],"new":[102],"class":[103],"blossom-type":[105],"inequalities":[106],"that":[107],"tighten":[108],"general":[110],"relaxation.":[113],"complete":[115],"description":[116],"convex":[119],"hull":[120],"unknown.":[126]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}