\textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
type: Item
instance of: scholarly article
title: \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
zbMATH Open document ID: 1434.90049
author: Mutsunori Banbara
author: Katsumi Inoue
author: Benjamin Kaufmann
author: Tenda Okimoto
author: Torsten Schaub
author: Takehide Soh
author: Naoyuki Tamura
author: Philipp Wanko
published in: Annals of Operations Research
publication date: 2019-03-06T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 7032706
zbMATH Keywords: educational timetabling
zbMATH Keywords: course timetabling
zbMATH Keywords: answer set programming
zbMATH Keywords: multi-objective optimization
zbMATH Keywords: minimal perturbation problems
describes a project that uses: SMAC
describes a project that uses: teaspoon
describes a project that uses: MiniSat
describes a project that uses: clasp
MaRDI profile type: Publication
full work available at URL: s10479-018-2757-7
OpenAlex ID: W2790306361
cites work: Unsatisfiability-based optimization in clasp
cites work: SAT-based MaxSAT algorithms
cites work: Answer set programming as a modeling language for course timetabling
cites work: Knowledge Representation, Reasoning and Declarative Problem Solving
cites work: An overview of curriculum-based course timetabling
cites work: Q5503674
cites work: Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
cites work: Recent research directions in automated timetabling
cites work: Decomposition, reformulation, and diving in university course timetabling
cites work: A supernodal formulation of vertex colouring with applications in course timetabling
cites work: A branch-and-cut procedure for the Udine course timetabling problem
cites work: maxSAT-based large neighborhood search for high school timetabling
cites work: Neighborhood portfolio approach for local search applied to timetabling problems
cites work: Temporal induction by incremental SAT solving
cites work: Multicriteria Optimization
cites work: Progress in clasp Series 3
cites work: Ricochet Robots Reloaded: A Case-Study in Multi-shot ASP Solving
cites work: Applying the threshold accepting metaheuristic to~curriculum based course timetabling
cites work: Curriculum based course timetabling: new solutions to Udine benchmark instances
cites work: A survey of metaheuristic-based techniques for university timetabling problems
cites work: Adaptive tabu search for course timetabling
cites work: Survey of multi-objective optimization methods for engineering
cites work: Setting the research agenda in automated timetabling: the second international timetabling competition
cites work: ITC2007 solver description: a hybrid approach
cites work: Logic programs with stable model semantics as a constraint programming paradigm
cites work: Probe backtrack search for minimal perturbation in dynamic scheduling
cites work: Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
cites work: Hybrid search for minimal perturbation in dynamic CSPs
DOI: 10.1007/S10479-018-2757-7
description: scientific article; zbMATH DE number 7032706