Curriculum-based course timetabling with SAT and MaxSAT
From MaRDI portal
Publication:475170
DOI10.1007/s10479-012-1081-xzbMath1301.90023OpenAlexW1964340145MaRDI QIDQ475170
Roberto Asín Achá, Robert Nieuwenhuis
Publication date: 26 November 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1081-x
Related Items
Fairness in academic course timetabling ⋮ Exploiting Resolution-Based Representations for MaxSAT Solving ⋮ Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem ⋮ WPM3: an (in)complete algorithm for weighted partial MaxSAT ⋮ Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency ⋮ A quest for a fair schedule: the international Young Physicists' Tournament ⋮ Exact and approximate determination of the Pareto front using minimal correction subsets ⋮ Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ Consensus-finding that preserves mutually conflicting hypothetical information from a same agent ⋮ Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling ⋮ Encoding cardinality constraints using multiway merge selection networks ⋮ On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving ⋮ Iterative and core-guided maxsat solving: a survey and assessment ⋮ Comments on: ``An overview of curriculum-based course timetabling ⋮ Proofs and Certificates for Max-SAT ⋮ An overview of curriculum-based course timetabling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient solver for weighted Max-SAT
- The intractability of resolution
- ITC2007 solver description: a hybrid approach
- Adaptive tabu search for course timetabling
- A framework for certified Boolean branch-and-bound optimization
- Compiling problem specifications into SAT
- Solving SAT and SAT Modulo Theories
- Formalizing Dangerous SAT Encodings
- Cardinality Networks and Their Applications
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Algorithms for Weighted Boolean Optimization
- Graph-Based Algorithms for Boolean Function Manipulation
- Theory and Applications of Satisfiability Testing
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- On Solving the Partial MAX-SAT Problem
- Principles and Practice of Constraint Programming – CP 2003
