Solving Kirkman's schoolgirl problem in a few seconds
From MaRDI portal
Publication:1774517
DOI10.1007/s10601-004-5305-9zbMath1112.90064OpenAlexW2179703577MaRDI QIDQ1774517
Pascal Brisset, Nicolas Barnier
Publication date: 17 May 2005
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://hal-enac.archives-ouvertes.fr/hal-00938024/file/290.pdf
Related Items (7)
Symmetry breaking constraints for value symmetries in constraint satisfaction ⋮ Enhancing set constraint solvers with lexicographic bounds ⋮ An effective greedy heuristic for the social golfer problem ⋮ An improved SAT formulation for the social golfer problem ⋮ Symmetry breaking revisited ⋮ Multicriteria models for planning power-networking events ⋮ Dynamic structural symmetry breaking for constraint satisfaction problems
Uses Software
Cites Work
- Interval propagation to reason about sets: Definition and implementation of a practical language
- Kirkman triple systems of order 21 with nontrivial automorphism group
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Principles and Practice of Constraint Programming – CP 2004
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Solving Kirkman's schoolgirl problem in a few seconds