Curriculum-based course timetabling with SAT and MaxSAT
From MaRDI portal
Recommendations
- Comments on: ``An overview of curriculum-based course timetabling
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- maxSAT-based large neighborhood search for high school timetabling
- scientific article; zbMATH DE number 1322611
Cites work
- scientific article; zbMATH DE number 5510691 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A framework for certified Boolean branch-and-bound optimization
- A machine program for theorem-proving
- Adaptive tabu search for course timetabling
- Algorithms for Weighted Boolean Optimization
- An efficient solver for weighted Max-SAT
- Cardinality Networks and Their Applications
- Compiling problem specifications into SAT
- Efficient CNF encoding of Boolean cardinality constraints
- Formalizing Dangerous SAT Encodings
- Graph-Based Algorithms for Boolean Function Manipulation
- ITC2007 solver description: a hybrid approach
- Minimaxsat: an efficient weighted Max-SAT solver
- On Solving the Partial MAX-SAT Problem
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- Solving weighted Max-SAT problems in a reduced search space: a performance analysis
- The intractability of resolution
- Theory and Applications of Satisfiability Testing
Cited in
(24)- Exact and approximate determination of the Pareto front using minimal correction subsets
- Comments on: ``An overview of curriculum-based course timetabling
- MaxSAT-based scheduling of B2B meetings
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
- Comments on: ``An overview of curriculum-based course timetabling
- Comments on: ``An overview of curriculum-based course timetabling
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
- Consensus-finding that preserves mutually conflicting hypothetical information from a same agent
- Fairness in academic course timetabling
- Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency
- A new model for curriculum-based university course timetabling
- An overview of curriculum-based course timetabling
- A quest for a fair schedule: the international Young Physicists' Tournament
- Educational timetabling: problems, benchmarks, and state-of-the-art results
- On using incremental encodings in unsatisfiability-based MaxSAT solving
- Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
- Iterative and core-guided maxsat solving: a survey and assessment
- Encoding cardinality constraints using multiway merge selection networks
- Benders decomposition for curriculum-based course timetabling
- Proofs and Certificates for Max-SAT
- Exploiting resolution-based representations for MaxSAT solving
- Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- Curriculum based course timetabling: new solutions to Udine benchmark instances
This page was built for publication: Curriculum-based course timetabling with SAT and MaxSAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475170)
