Applying constraint programming to minimal lottery designs

DOI10.1007/S10601-024-09368-5MaRDI QIDQ7031953zbMATH OpenFDO

Authors David Cushing, David I. Stewart

Publication date 6 February 2025

Published in Constraints (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10601-024-09368-5

zbMATH Keywords

combinatorial designsfinite-domain constraint programminglotto designsProlog

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Integer programming (90C10) Combinatorial optimization (90C27)

Cites work

• \(S\)-crucial and bicrucial permutations with respect to squares
• A Prolog assisted search for new simple Lie algebras
• A Theorem on Coloring the Lines of a Network
• scientific article; zbMATH DE number 1279020 (Why is no real title available?)
• On the lottery problem
• On Vizing's bound for the chromatic index of a multigraph
• SICStus Prolog -- the first 25 years
• The CRC handbook of combinatorial designs

This page was built for publication: Applying constraint programming to minimal lottery designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7031953)