Sports League Scheduling: Enumerative Search for Prob026 from CSPLib | Zendy

Jean-Philippe Hamiez | Zendy; JinKao Hao | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Sports League Scheduling: Enumerative Search for Prob026 from CSPLib

Author(s) -

Jean-Philippe Hamiez,

JinKao Hao

Publication year - 2006

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-46267-8

DOI - 10.1007/11889205_57

Subject(s) - computer science , scheduling (production processes) , league , mathematical optimization , simple (philosophy) , job shop scheduling , constraint (computer aided design) , theoretical computer science , mathematics , schedule , philosophy , physics , geometry , epistemology , astronomy , operating system

This paper presents an enumerative approach for a sports league scheduling problem. This simple method can solve some instances involving a number T of teams up to 70 while the best known constraint programing algorithm is limited to T≤40. The proposed approach relies on interesting properties which are used to constraint the search process

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research