{"id":"https://openalex.org/W1993547535","doi":"https://doi.org/10.1007/s13675-013-0010-3","title":"A complete search method for the relaxed traveling tournament problem","display_name":"A complete search method for the relaxed traveling tournament problem","publication_year":2013,"publication_date":"2013-04-30","ids":{"openalex":"https://openalex.org/W1993547535","doi":"https://doi.org/10.1007/s13675-013-0010-3","mag":"1993547535"},"language":"en","primary_location":{"id":"doi:10.1007/s13675-013-0010-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-013-0010-3","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1007/s13675-013-0010-3","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088005421","display_name":"Filipe Brand\u00e3o","orcid":"https://orcid.org/0000-0003-2524-3482"},"institutions":[{"id":"https://openalex.org/I4210166615","display_name":"INESC TEC","ror":"https://ror.org/05fa8ka61","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I4210125590","https://openalex.org/I4210166615"]},{"id":"https://openalex.org/I182534213","display_name":"Universidade do Porto","ror":"https://ror.org/043pwc612","country_code":"PT","type":"education","lineage":["https://openalex.org/I182534213"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Filipe Brand\u00e3o","raw_affiliation_strings":["INESC TEC and Faculdade de Ci\u00eancias, Universidade do Porto, Rua do Campo Alegre, 4169-007, Porto, Portugal","INESC TEC and Faculdade de Ci\u00eancias, Universidade do Porto"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INESC TEC and Faculdade de Ci\u00eancias, Universidade do Porto, Rua do Campo Alegre, 4169-007, Porto, Portugal","institution_ids":["https://openalex.org/I182534213","https://openalex.org/I4210166615"]},{"raw_affiliation_string":"INESC TEC and Faculdade de Ci\u00eancias, Universidade do Porto","institution_ids":["https://openalex.org/I182534213"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065962709","display_name":"Jo\u00e3o Pedro Pedroso","orcid":"https://orcid.org/0000-0003-1298-7191"},"institutions":[{"id":"https://openalex.org/I182534213","display_name":"Universidade do Porto","ror":"https://ror.org/043pwc612","country_code":"PT","type":"education","lineage":["https://openalex.org/I182534213"]},{"id":"https://openalex.org/I4210166615","display_name":"INESC TEC","ror":"https://ror.org/05fa8ka61","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I4210125590","https://openalex.org/I4210166615"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Jo\u00e3oPedro Pedroso","raw_affiliation_strings":["INESC TEC and Faculdade de Ci\u00eancias, Universidade do Porto, Rua do Campo Alegre, 4169-007, Porto, Portugal","INESC TEC and Faculdade de Ci\u00eancias, Universidade do Porto"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INESC TEC and Faculdade de Ci\u00eancias, Universidade do Porto, Rua do Campo Alegre, 4169-007, Porto, Portugal","institution_ids":["https://openalex.org/I182534213","https://openalex.org/I4210166615"]},{"raw_affiliation_string":"INESC TEC and Faculdade de Ci\u00eancias, Universidade do Porto","institution_ids":["https://openalex.org/I182534213"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088005421"],"corresponding_institution_ids":["https://openalex.org/I182534213","https://openalex.org/I4210166615"],"apc_list":{"value":1400,"currency":"USD","value_usd":1400},"apc_paid":{"value":1400,"currency":"USD","value_usd":1400},"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.11620032,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"2","issue":"1-2","first_page":"77","last_page":"86"},"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.9830999970436096,"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.9789999723434448,"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.8789941072463989},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6811342239379883},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6375935673713684},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5745934247970581},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5613240003585815},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5448799133300781},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.48743417859077454},{"id":"https://openalex.org/keywords/tournament-selection","display_name":"Tournament selection","score":0.456760436296463},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.41672617197036743},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.299127995967865},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.0828830897808075},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07592877745628357}],"concepts":[{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.8789941072463989},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6811342239379883},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6375935673713684},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5745934247970581},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5613240003585815},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5448799133300781},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.48743417859077454},{"id":"https://openalex.org/C165661538","wikidata":"https://www.wikidata.org/wiki/Q7829327","display_name":"Tournament selection","level":3,"score":0.456760436296463},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.41672617197036743},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.299127995967865},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.0828830897808075},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07592877745628357},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s13675-013-0010-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-013-0010-3","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:95c7bebf44ba460ba6c53c0e2963f990","is_oa":true,"landing_page_url":"https://doaj.org/article/95c7bebf44ba460ba6c53c0e2963f990","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"EURO Journal on Computational Optimization, Vol 2, Iss 1, Pp 77-86 (2014)","raw_type":"article"},{"id":"pmh:oai:repositorio.inesctec.pt:123456789/4678","is_oa":false,"landing_page_url":"http://repositorio.inesctec.pt/handle/123456789/4678","pdf_url":null,"source":{"id":"https://openalex.org/S4306402433","display_name":"Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":{"id":"doi:10.1007/s13675-013-0010-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-013-0010-3","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W96818046","https://openalex.org/W1569558302","https://openalex.org/W1601564682","https://openalex.org/W2062742101","https://openalex.org/W2150470619","https://openalex.org/W2157841753","https://openalex.org/W2343571732"],"related_works":["https://openalex.org/W2909372716","https://openalex.org/W3029891807","https://openalex.org/W1572785861","https://openalex.org/W4352981148","https://openalex.org/W1571917368","https://openalex.org/W140783093","https://openalex.org/W2136437817","https://openalex.org/W2080638133","https://openalex.org/W2057901175","https://openalex.org/W2554253816"],"abstract_inverted_index":{"The":[0],"traveling":[1,86],"tournament":[2,87],"problem":[3,8,98],"is":[4],"a":[5,57,69,79,91],"sports":[6,42],"scheduling":[7],"that":[9,44],"includes":[10],"two":[11],"major":[12],"issues":[13],"in":[14,34,71],"creating":[15],"timetables:":[16],"home/away":[17,47],"pattern":[18,48],"feasibility":[19],"and":[20,50,103],"travel":[21],"distance.":[22],"In":[23,60],"this":[24,97],"problem,":[25],"the":[26,82,84],"schedule":[27],"must":[28],"be":[29],"compact:":[30],"every":[31,35],"team":[32],"plays":[33],"time":[36,73],"slot.":[37,74],"However,":[38],"there":[39],"are":[40],"some":[41],"leagues":[43],"have":[45,68],"both":[46],"restrictions":[49],"distance":[51],"limits,":[52],"but":[53],"do":[54],"not":[55],"require":[56],"compact":[58],"schedule.":[59],"such":[61],"schedules,":[62],"one":[63],"or":[64],"more":[65],"teams":[66],"can":[67],"bye":[70],"any":[72],"This":[75],"leads":[76],"us":[77],"to":[78,95],"variant":[80],"of":[81],"problem:":[83],"relaxed":[85],"problem.":[88],"We":[89],"present":[90],"complete":[92],"search":[93],"method":[94],"solve":[96],"based":[99],"on":[100],"branch-and-bound,":[101],"metaheuristics":[102],"dynamic":[104],"programming.":[105]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}