A logic approach to the resolution of constraints in timetabling
type: Item
instance of: scholarly article
title: A logic approach to the resolution of constraints in timetabling
zbMATH Open document ID: 0757.90033
DOI: 10.1016/0377-2217(92)90360-L
author: Le Kang
author: George M. White
published in: European Journal of Operational Research
publication date: 1992-10-06T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 68464
zbMATH Keywords: logic programming
zbMATH Keywords: expert systems
zbMATH Keywords: timetables
zbMATH Keywords: heuristic solutions
MaRDI profile type: Publication
cites work: New methods to color the vertices of a graph
cites work: A Lagrangian Relaxation Approach To The Classroom Assignment Problem*
cites work: An introduction to timetabling
cites work: Solving a cutting-stock problem with the constraint logic programming language CHIP
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Q3198899
cites work: Timetabling problem for university as assignment of activities to resources
cites work: A classroom/time assignment model
cites work: A Machine-Oriented Logic Based on the Resolution Principle
Recommended article: Q3095714
Recommended article: Q3152950
Recommended article: Q4427092
Recommended article: Timetable planning using the constraint-based reasoning
Recommended article: University timetabling by constraint-based reasoning: A case study
Recommended article: Constraint logic programming for examination timetabling
Recommended article: Q4218845
Recommended article: Towards constraint-based school timetabling
Recommended article: Constraint programming approach for school timetabling.
Recommended article: Q4849545
description: scientific article; zbMATH DE number 68464