{"id":"https://openalex.org/W4410032382","doi":"https://doi.org/10.1287/moor.2024.0518","title":"An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling","display_name":"An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling","publication_year":2025,"publication_date":"2025-05-02","ids":{"openalex":"https://openalex.org/W4410032382","doi":"https://doi.org/10.1287/moor.2024.0518"},"language":"en","primary_location":{"id":"doi:10.1287/moor.2024.0518","is_oa":false,"landing_page_url":"https://doi.org/10.1287/moor.2024.0518","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":["University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, China"],"raw_orcid":"https://orcid.org/0000-0003-2322-750X","affiliations":[{"raw_affiliation_string":"University of Electronic Science and Technology of China, Chengdu, Sichuan 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":false,"raw_author_name":"Mingyu Xiao","raw_affiliation_strings":["University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, China"],"raw_orcid":"https://orcid.org/0000-0002-1012-2373","affiliations":[{"raw_affiliation_string":"University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, China","institution_ids":["https://openalex.org/I150229711"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0958506,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"51","issue":"2","first_page":"988","last_page":"1006"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998000264167786,"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.9998000264167786,"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.95169997215271,"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/T10731","display_name":"Educational Games and Gamification","score":0.9391999840736389,"subfield":{"id":"https://openalex.org/subfields/3204","display_name":"Developmental and Educational Psychology"},"field":{"id":"https://openalex.org/fields/32","display_name":"Psychology"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tournament","display_name":"Tournament","score":0.8348218202590942},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7733827233314514},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7182189226150513},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5141199231147766},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.49262839555740356},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4485526978969574},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3802945017814636},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.16196554899215698}],"concepts":[{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.8348218202590942},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7733827233314514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7182189226150513},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5141199231147766},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.49262839555740356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4485526978969574},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3802945017814636},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16196554899215698}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1287/moor.2024.0518","is_oa":false,"landing_page_url":"https://doi.org/10.1287/moor.2024.0518","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1971938577","https://openalex.org/W1972849741","https://openalex.org/W1979001927","https://openalex.org/W1979381633","https://openalex.org/W2021791623","https://openalex.org/W2032550399","https://openalex.org/W2051443526","https://openalex.org/W2062742101","https://openalex.org/W2075183781","https://openalex.org/W2111563176","https://openalex.org/W2118240569","https://openalex.org/W2157841753","https://openalex.org/W2752908210","https://openalex.org/W2958369069","https://openalex.org/W4205585032","https://openalex.org/W4380422914","https://openalex.org/W4394604800","https://openalex.org/W4406686215"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W3123786980","https://openalex.org/W2994965880","https://openalex.org/W4287997709","https://openalex.org/W3083287393","https://openalex.org/W3094108612","https://openalex.org/W2044692892","https://openalex.org/W4390409907","https://openalex.org/W2586280130","https://openalex.org/W4221143622"],"abstract_inverted_index":{"The":[0],"bipartite":[1,16],"traveling":[2,29],"tournament":[3,17],"problem":[4],"(BTTP)":[5],"addresses":[6],"interleague":[7],"sports":[8],"scheduling,":[9],"which":[10,131],"aims":[11],"to":[12,45],"design":[13,46],"a":[14,68,73,117],"feasible":[15,47],"between":[18],"two":[19],"n-team":[20],"leagues":[21],"under":[22],"some":[23],"constraints":[24],"such":[25],"that":[26,82,94,141],"the":[27,50,80,92,105,134,139,151],"total":[28],"distance":[30],"of":[31,64,156],"all":[32],"participating":[33],"teams":[34],"is":[35,77],"minimized.":[36],"Since":[37],"its":[38],"introduction,":[39],"several":[40],"methods":[41],"have":[42],"been":[43],"developed":[44],"schedules":[48],"for":[49,79,91,122,138],"National":[51,152],"Basketball":[52],"Association":[53],"(NBA),":[54],"Nippon":[55],"Professional":[56],"Baseball":[57],"(NPB),":[58],"and":[59,98,125,161],"so":[60],"on.":[61],"In":[62,107],"terms":[63],"solution":[65],"quality":[66],"with":[67],"theoretical":[69],"guarantee,":[70],"previously,":[71],"only":[72],"[Formula:":[74,83,95,99,118,128,142],"see":[75,84,96,100,119,129,143],"text]-approximation":[76,120],"known":[78],"case":[81,140],"text].":[85,144],"Whether":[86],"there":[87],"are":[88],"similar":[89],"results":[90],"cases":[93],"text]":[97,101],"was":[102,148],"asked":[103],"in":[104],"literature.":[106],"this":[108,112],"paper,":[109],"we":[110],"answer":[111],"question":[113],"positively":[114],"by":[115,150],"proposing":[116],"algorithm":[121],"any":[123,126],"n":[124],"constant":[127],"text],":[130],"also":[132],"improves":[133],"previous":[135],"approximation":[136],"ratio":[137],"Funding:":[145],"This":[146],"research":[147],"supported":[149],"Natural":[153],"Science":[154],"Foundation":[155],"China":[157],"[Grants":[158],"62372095,":[159],"62172077,":[160],"62350710215].":[162]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}