{"id":"https://openalex.org/W4394604800","doi":"https://doi.org/10.1287/moor.2022.0356","title":"Practical Algorithms with Guaranteed Approximation Ratio for Traveling Tournament Problem with Maximum Tour Length 2","display_name":"Practical Algorithms with Guaranteed Approximation Ratio for Traveling Tournament Problem with Maximum Tour Length 2","publication_year":2024,"publication_date":"2024-04-09","ids":{"openalex":"https://openalex.org/W4394604800","doi":"https://doi.org/10.1287/moor.2022.0356"},"language":"en","primary_location":{"id":"doi:10.1287/moor.2022.0356","is_oa":false,"landing_page_url":"https://doi.org/10.1287/moor.2022.0356","pdf_url":null,"source":{"id":"https://openalex.org/S55826652","display_name":"Mathematics of Operations Research","issn_l":"0364-765X","issn":["0364-765X","1526-5471"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematics of Operations Research","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/A5037988025","display_name":"Jingyang Zhao","orcid":"https://orcid.org/0000-0003-2322-750X"},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jingyang Zhao","raw_affiliation_strings":["School of Computer Science and Engineering, School of Computer Science, University of Electronic Science and Technology of China, Chengdu 611731, China"],"raw_orcid":"https://orcid.org/0000-0003-2322-750X","affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, School of Computer Science, University of Electronic Science and Technology of China, Chengdu 611731, China","institution_ids":["https://openalex.org/I150229711"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033729619","display_name":"Mingyu Xiao","orcid":"https://orcid.org/0000-0002-1012-2373"},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Mingyu Xiao","raw_affiliation_strings":["School of Computer Science and Engineering, School of Computer Science, University of Electronic Science and Technology of China, Chengdu 611731, China"],"raw_orcid":"https://orcid.org/0000-0002-1012-2373","affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, School of Computer Science, University of Electronic Science and Technology of China, Chengdu 611731, China","institution_ids":["https://openalex.org/I150229711"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5033729619"],"corresponding_institution_ids":["https://openalex.org/I150229711"],"apc_list":null,"apc_paid":null,"fwci":1.7426,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.84429141,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":"50","issue":"2","first_page":"910","last_page":"934"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9952999949455261,"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/T12288","display_name":"Optimization and Search Problems","score":0.9763000011444092,"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/tournament","display_name":"Tournament","score":0.8214437961578369},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7860580682754517},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5447694659233093},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.405534952878952},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31797534227371216}],"concepts":[{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.8214437961578369},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7860580682754517},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5447694659233093},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.405534952878952},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31797534227371216}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1287/moor.2022.0356","is_oa":false,"landing_page_url":"https://doi.org/10.1287/moor.2022.0356","pdf_url":null,"source":{"id":"https://openalex.org/S55826652","display_name":"Mathematics of Operations Research","issn_l":"0364-765X","issn":["0364-765X","1526-5471"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematics of Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:inm:ormoor:v:50:y:2025:i:2:p:910-934","is_oa":false,"landing_page_url":"http://doi.org/10.1287/moor.2022.0356","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W292355835","https://openalex.org/W1584124733","https://openalex.org/W1601564682","https://openalex.org/W1965391651","https://openalex.org/W1966852875","https://openalex.org/W1971938577","https://openalex.org/W1972849741","https://openalex.org/W1979001927","https://openalex.org/W1979381633","https://openalex.org/W2032550399","https://openalex.org/W2037670790","https://openalex.org/W2051443526","https://openalex.org/W2062742101","https://openalex.org/W2075183781","https://openalex.org/W2118240569","https://openalex.org/W2125690626","https://openalex.org/W2157841753","https://openalex.org/W2482644989","https://openalex.org/W2921898020","https://openalex.org/W2958369069","https://openalex.org/W4231916799"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W3123786980","https://openalex.org/W4287997709","https://openalex.org/W2994965880","https://openalex.org/W3083287393","https://openalex.org/W3094108612","https://openalex.org/W3125314910","https://openalex.org/W2982074041","https://openalex.org/W2130950591","https://openalex.org/W2041858633"],"abstract_inverted_index":{"The":[0],"traveling":[1],"tournament":[2],"problem":[3,12],"(TTP)":[4],"is":[5,19,50,129,147],"a":[6,22],"hard":[7],"but":[8],"interesting":[9],"sports":[10],"scheduling":[11],"inspired":[13],"by":[14,45,194],"Major":[15],"League":[16],"Baseball,":[17],"which":[18],"to":[20,165],"design":[21],"double":[23],"round-robin":[24],"schedule":[25],"such":[26],"that":[27,63,173],"each":[28,36,76],"pair":[29],"of":[30,92,97,137,155,187,200],"teams":[31,48],"plays":[32],"one":[33],"game":[34],"in":[35],"other\u2019s":[37],"home":[38,68],"venue,":[39],"minimizing":[40],"the":[41,61,93,98,134,152,195,207],"total":[42],"distance":[43],"traveled":[44],"all":[46,100,181],"n":[47],"(n":[49],"even).":[51],"In":[52,78,159],"this":[53,79],"paper,":[54,80],"we":[55,81],"consider":[56],"TTP-2":[57,86,104],"(i.e.,":[58],"TTP":[59],"under":[60],"constraint":[62],"at":[64],"most":[65],"two":[66,121],"consecutive":[67],"games":[69,72],"or":[70],"away":[71],"are":[73,105,116,163],"allowed":[74],"for":[75,85,103,107,119,180],"team).":[77],"propose":[82],"practical":[83],"algorithms":[84,102,115,162,175],"with":[87,183],"improved":[88],"approximation":[89,127,145],"ratios.":[90],"Because":[91],"different":[94,106,118],"structural":[95],"properties":[96],"problem,":[99],"known":[101,178],"n/2":[108],"being":[109],"odd":[110,142],"and":[111,113,204,206],"even,":[112],"our":[114,126,144,161,174],"also":[117],"these":[120],"cases.":[122],"For":[123,141],"even":[124],"n/2,":[125,143],"ratio":[128,146],"[Formula:":[130,138,148,156],"see":[131,139,149,157],"text],":[132,150],"improving":[133,151],"previous":[135,153],"result":[136,154],"text].":[140,158],"practice,":[160],"easy":[164],"implement.":[166],"Experiments":[167],"on":[168],"well-known":[169],"benchmark":[170],"sets":[171],"show":[172],"beat":[176],"previously":[177],"solutions":[179],"instances":[182],"an":[184],"average":[185],"improvement":[186],"5.66%.":[188],"Funding:":[189],"This":[190],"work":[191],"was":[192],"supported":[193],"National":[196],"Natural":[197,209],"Science":[198,210],"Foundation":[199,211],"China":[201],"[Grants":[202],"62372095":[203],"62172077]":[205],"Sichuan":[208],"[Grant":[212],"2023NSFSC0059].":[213]},"counts_by_year":[{"year":2025,"cited_by_count":5}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}