\textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
From MaRDI portal
Publication:1730740
Recommendations
Cites work
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
- A branch-and-cut procedure for the Udine course timetabling problem
- A supernodal formulation of vertex colouring with applications in course timetabling
- A survey of metaheuristic-based techniques for university timetabling problems
- Adaptive tabu search for course timetabling
- An overview of curriculum-based course timetabling
- Answer set programming as a modeling language for course timetabling
- Applying the threshold accepting metaheuristic to~curriculum based course timetabling
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- Decomposition, reformulation, and diving in university course timetabling
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Hybrid search for minimal perturbation in dynamic CSPs
- ITC2007 solver description: a hybrid approach
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Logic programs with stable model semantics as a constraint programming paradigm
- maxSAT-based large neighborhood search for high school timetabling
- Multicriteria Optimization
- Neighborhood portfolio approach for local search applied to timetabling problems
- Probe backtrack search for minimal perturbation in dynamic scheduling
- Progress in clasp series 3
- Recent research directions in automated timetabling
- Ricochet Robots reloaded: a case-study in multi-shot ASP solving
- SAT-based MaxSAT algorithms
- Setting the research agenda in automated timetabling: the second international timetabling competition
- Survey of multi-objective optimization methods for engineering
- Temporal induction by incremental SAT solving
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Unsatisfiability-based optimization in clasp
Cited in
(9)- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
- Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions
- Shift design with answer set programming
- Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
- Answer set programming as a modeling language for course timetabling
- Hybrid ASP-based multi-objective scheduling of semiconductor manufacturing processes
- Integrating competencies into preventive maintenance scheduling with answer set optimization
- Decomposition strategies and multi-shot ASP solving for job-shop scheduling
- Revisiting local search for curriculum-based course timetabling
This page was built for publication: \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1730740)
