Programmed Search in a Timetabling Problem over Finite Domains

DOI10.1016/j.entcs.2007.01.013zbMath1279.68303OpenAlexW2034401919MaRDI QIDQ2873803

Ramón González-del-Campo, Fernando Sáenz-Pérez

Publication date: 24 January 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.01.013

zbMATH Keywords

applicationstimetablingsearchfinite domains

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (2)

Mathematical models and algorithms for a high school timetabling problem ⋮ A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems

Uses Software

• Genocop
• GAMS
• Curry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recent research directions in automated timetabling
• Constraint functional logic programming over finite domains
• Advances in Artificial Intelligence – SBIA 2004

This page was built for publication: Programmed Search in a Timetabling Problem over Finite Domains