{"id":"https://openalex.org/W2303916956","doi":"https://doi.org/10.1090/dimacs/057/07","title":"Minimization of the number of breaks in sports scheduling problems using constraint programming","display_name":"Minimization of the number of breaks in sports scheduling problems using constraint programming","publication_year":2001,"publication_date":"2001-02-27","ids":{"openalex":"https://openalex.org/W2303916956","doi":"https://doi.org/10.1090/dimacs/057/07","mag":"2303916956"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/057/07","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/057/07","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5083321766","display_name":"Jean-Charles R\u00e9gin","orcid":"https://orcid.org/0000-0001-6204-5894"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jean-Charles R\u00e9gin","raw_affiliation_strings":["Les Taissouni eres HB2 06560 Valbonne, FRANCE"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Les Taissouni eres HB2 06560 Valbonne, FRANCE","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5083321766"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.1255,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.96982249,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"115","last_page":"130"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9991999864578247,"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.9991999864578247,"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/T10731","display_name":"Educational Games and Gamification","score":0.9837999939918518,"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/constraint-programming","display_name":"Constraint programming","score":0.5667479038238525},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5467778444290161},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5080482959747314},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5074650645256042},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4654102623462677},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4195975661277771},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3675937056541443},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3089538812637329},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.06647419929504395}],"concepts":[{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5667479038238525},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5467778444290161},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5080482959747314},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5074650645256042},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4654102623462677},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4195975661277771},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3675937056541443},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3089538812637329},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.06647419929504395},{"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.1090/dimacs/057/07","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/057/07","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.644.3434","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.644.3434","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cse.unl.edu/~choueiry/Documents/Regin/minbreak.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1728735140","https://openalex.org/W2038997204","https://openalex.org/W2166264273"],"related_works":["https://openalex.org/W2365854838","https://openalex.org/W2965214198","https://openalex.org/W2006950312","https://openalex.org/W1972283285","https://openalex.org/W2597679104","https://openalex.org/W2085816591","https://openalex.org/W1723103382","https://openalex.org/W2158954775","https://openalex.org/W2347765604","https://openalex.org/W2390815705"],"abstract_inverted_index":{"This":[0],"paper":[1],"aims":[2],"to":[3,50,82,123,172,199,205,215],"show":[4],"the":[5,12,73,94,104,121,153,177,191,219],"interest":[6],"of":[7,14,29,107,155,176,193,222,228],"constraint":[8,117],"programming":[9,118],"for":[10,44,77,137,150,188,224],"minimizing":[11],"number":[13,28,106,192,221],"breaks":[15,108,223],"in":[16,180],"sports":[17],"scheduling":[18],"problems.":[19],"We":[20,112,211],"consider":[21],"single":[22],"round-robin":[23],"problems":[24],"with":[25,159],"an":[26],"even":[27],"teams.":[30,229],"In":[31],"such":[32,61,186],"a":[33,78,114,133],"problem":[34,179],"we":[35],"are":[36,164,184,212],"given":[37,226],"n":[38,110],"teams":[39,130,139],"and":[40,43,136,195,217],"n1":[41],"periods":[42],"each":[45,47,189],"period":[46],"team":[48,60,64,68,79,190],"has":[49,98,120,198],"play":[51],"either":[52],"at":[53],"home":[54,86,196],"or":[55,88],"away":[56,91,194],"game":[57],"against":[58],"another":[59],"that":[62,103,119],"every":[63,66],"plays":[65],"other":[67],"exactly":[69],"once":[70],"during":[71],"all":[72],"periods.":[74],"A":[75],"break":[76],"is":[80,109,152,169,203],"dened":[81],"be":[83,200],"two":[84,89,207],"consecutive":[85,90,208],"matches":[87,197],"matches.":[92],"For":[93,128],"considered":[95],"problem,":[96],"it":[97,140,202],"been":[99],"proven":[100],"by":[101],"Schreuder":[102],"minimal":[105,220],"2.":[111],"propose":[113],"model":[115,168],"using":[116],"capability":[122],"eciently":[124],"prove":[125,218],"this":[126,131,151,167],"result.":[127],"20":[129],"takes":[132,142],"mere":[134],"0.61s":[135],"60":[138],"still":[141],"less":[143],"than":[144],"1":[145,230,231],"minute.":[146],"The":[147],"main":[148],"reason":[149],"use":[154],"several":[156],"global":[157],"constraints":[158,183],"which":[160,181],"powerful":[161],"ltering":[162],"algorithms":[163],"associated.":[165],"Moreover,":[166],"well":[170],"adapted":[171],"solve":[173],"some":[174,225],"variations":[175],"initial":[178],"new":[182],"added":[185],"as:":[187],"balanced,":[201],"forbidden":[204],"have":[206],"breaks,":[209],"etc.":[210],"also":[213],"able":[214],"nd":[216],"timetables":[227]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-08T01:25:22.217667","created_date":"2025-10-10T00:00:00"}