{"id":"https://openalex.org/W2227009375","doi":"https://doi.org/10.1080/10556788.2015.1104679","title":"Maximal matching polytope in trees","display_name":"Maximal matching polytope in trees","publication_year":2015,"publication_date":"2015-11-13","ids":{"openalex":"https://openalex.org/W2227009375","doi":"https://doi.org/10.1080/10556788.2015.1104679","mag":"2227009375"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2015.1104679","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2015.1104679","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5023962232","display_name":"Mustafa Kemal Tural","orcid":"https://orcid.org/0000-0002-7173-7646"},"institutions":[{"id":"https://openalex.org/I201799495","display_name":"Middle East Technical University","ror":"https://ror.org/014weej12","country_code":"TR","type":"education","lineage":["https://openalex.org/I201799495"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Mustafa Kemal Tural","raw_affiliation_strings":["Department of Industrial Engineering, Middle East Technical University, Ankara, Turkey"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Middle East Technical University, Ankara, Turkey","institution_ids":["https://openalex.org/I201799495"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023962232"],"corresponding_institution_ids":["https://openalex.org/I201799495"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.1156042,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"31","issue":"3","first_page":"471","last_page":"478"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T12288","display_name":"Optimization and Search Problems","score":0.9804999828338623,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.8321475982666016},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7867938280105591},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7620221972465515},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6382407546043396},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6274049282073975},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5931499600410461},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5700202584266663},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5635859966278076},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.5474496483802795},{"id":"https://openalex.org/keywords/birkhoff-polytope","display_name":"Birkhoff polytope","score":0.5290892124176025},{"id":"https://openalex.org/keywords/polyhedral-combinatorics","display_name":"Polyhedral combinatorics","score":0.5079384446144104},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.41331690549850464},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40791600942611694},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3865067660808563},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2688184678554535},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.1637125313282013},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.09804573655128479}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.8321475982666016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7867938280105591},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7620221972465515},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6382407546043396},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6274049282073975},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5931499600410461},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5700202584266663},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5635859966278076},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.5474496483802795},{"id":"https://openalex.org/C206304794","wikidata":"https://www.wikidata.org/wiki/Q4916482","display_name":"Birkhoff polytope","level":5,"score":0.5290892124176025},{"id":"https://openalex.org/C174248988","wikidata":"https://www.wikidata.org/wiki/Q8348314","display_name":"Polyhedral combinatorics","level":5,"score":0.5079384446144104},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.41331690549850464},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40791600942611694},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3865067660808563},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2688184678554535},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.1637125313282013},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.09804573655128479},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10556788.2015.1104679","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2015.1104679","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},{"id":"pmh:oai:open.metu.edu.tr:11511/34550","is_oa":false,"landing_page_url":"https://hdl.handle.net/11511/34550","pdf_url":null,"source":{"id":"https://openalex.org/S4306402495","display_name":"OpenMETU (Middle East Technical University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I201799495","host_organization_name":"Middle East Technical University","host_organization_lineage":["https://openalex.org/I201799495"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","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/W1502057009","https://openalex.org/W1988133548","https://openalex.org/W2003391451","https://openalex.org/W2040166238","https://openalex.org/W2075081186","https://openalex.org/W2083165612","https://openalex.org/W2095011965","https://openalex.org/W2097286222","https://openalex.org/W2128024934","https://openalex.org/W2130444404","https://openalex.org/W2327315803","https://openalex.org/W2592631749","https://openalex.org/W3043081082"],"related_works":["https://openalex.org/W2016944804","https://openalex.org/W4288417334","https://openalex.org/W4300637737","https://openalex.org/W2952452737","https://openalex.org/W3088865259","https://openalex.org/W2069107464","https://openalex.org/W2056010966","https://openalex.org/W2089946268","https://openalex.org/W2346823476","https://openalex.org/W4299594889"],"abstract_inverted_index":{"Given":[0],"a":[1,17,101],"weighted":[2,7,117,135],"simple":[3],"graph,":[4],"the":[5,13,47,60,73,77,92,96,109,113,125],"minimum":[6,21],"maximal":[8,18,81,84],"matching":[9,19,85],"(MWMM)":[10],"problem":[11,14,25,49,115,127],"is":[12,26,31,89,137],"of":[15,20,38,76,80,100,112,121],"finding":[16],"weight.":[22],"The":[23,119],"MWMM":[24,48,114,126],"NP-hard":[27],"in":[28,34,53,56,87,116,131,134],"general,":[29],"but":[30],"polynomial-time":[32,110],"solvable":[33],"some":[35],"special":[36],"classes":[37],"graphs.":[39],"For":[40],"instance,":[41],"it":[42],"has":[43],"been":[44],"shown":[45],"that":[46,72],"can":[50,128],"be":[51,129],"solved":[52,130],"linear":[54,97,132],"time":[55,133],"trees":[57,88,136],"when":[58],"all":[59],"edge":[61],"weights":[62],"are":[63],"equal":[64],"to":[65],"one.":[66],"In":[67],"this":[68],"paper,":[69],"we":[70],"show":[71],"convex":[74],"hull":[75],"incidence":[78],"vectors":[79],"matchings":[82],"(the":[83],"polytope)":[86],"given":[90],"by":[91,95],"polytope":[93],"described":[94],"programming":[98,105],"relaxation":[99],"recently":[102],"proposed":[103],"integer":[104],"formulation.":[106],"This":[107],"establishes":[108],"solvability":[111],"trees.":[118],"question":[120],"whether":[122],"or":[123],"not":[124],"open.":[138]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":3}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}