Curriculum-based course timetabling with SAT and MaxSAT
From MaRDI portal
Publication:475170
DOI10.1007/S10479-012-1081-XzbMATH Open1301.90023OpenAlexW1964340145MaRDI QIDQ475170FDOQ475170
Authors: 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
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
- Theory and Applications of Satisfiability Testing
- Title not available (Why is that?)
- Minimaxsat: an efficient weighted Max-SAT solver
- Graph-Based Algorithms for Boolean Function Manipulation
- Efficient CNF encoding of Boolean cardinality constraints
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Algorithms for Weighted Boolean Optimization
- On Solving the Partial MAX-SAT Problem
- ITC2007 solver description: a hybrid approach
- Adaptive tabu search for course timetabling
- Solving SAT and SAT Modulo Theories
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- The intractability of resolution
- Solving weighted Max-SAT problems in a reduced search space: a performance analysis
- A framework for certified Boolean branch-and-bound optimization
- Compiling problem specifications into SAT
- Formalizing Dangerous SAT Encodings
- Cardinality Networks and Their Applications
- An efficient solver for weighted Max-SAT
Cited In (22)
- Exploiting Resolution-Based Representations for MaxSAT Solving
- An overview of curriculum-based course timetabling
- Fairness in academic course timetabling
- Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
- Exact and approximate determination of the Pareto front using minimal correction subsets
- On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving
- Comments on: ``An overview of curriculum-based course timetabling
- Comments on: ``An overview of curriculum-based course timetabling
- Comments on: ``An overview of curriculum-based course timetabling
- Consensus-finding that preserves mutually conflicting hypothetical information from a same agent
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling
- A new model for curriculum-based university course timetabling
- Iterative and core-guided maxsat solving: a survey and assessment
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
- Benders decomposition for curriculum-based course timetabling
- Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency
- A quest for a fair schedule: the international Young Physicists' Tournament
- Proofs and Certificates for Max-SAT
- Encoding cardinality constraints using multiway merge selection networks
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- Educational timetabling: problems, benchmarks, and state-of-the-art results
Uses Software
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)
