Puzzle—Solving the n-Fractions Puzzle as a Constraint Programming Problem

References

• Beldiceanu N, Carlsson M, Demassey S (2017) Global constraint catalogue. Accessed April 26, 2018, http://sofdem.github.io/gccat/.Google Scholar
• Flener P, Frisch AM, Hnich B, Kiziltan Z, Miguel I, Pearson J, Walsh T (2002) Breaking Row and Column Symmetries in Matrix Models. Van Hentenryck P, ed. Proc. 8th Internat. Conf. Principles Practice Constraint Programming, CP 2002 (Springer, Berlin),462–477.Google Scholar
• Frisch A, Miguel I, Walsh T (2001) Extensions to proof planning for generating implied constraints. Proc. Calculemus-01, 130–141.Google Scholar
• Frisch A, Jefferson C, Miguel I, Walsh T (1999) CSPLib problem 041: The n-fractions puzzle. Accessed April 26, 2018, http://www.csplib.org/Problems/prob041.Google Scholar
• Frisch AM, Jefferson C, Miguel I (2004) Symmetry breaking as a prelude to implied constraints: A constraint modelling pattern. López de Mántaras R, Saitta L, eds. Proc. 16th Eur. Conf. Artificial Intelligence, ECAI’2004 (IOS Press, Amsterdam), 171–175.Google Scholar
• Hardy GH, Littlewood JE, Pólya G (1952) Inequalities. Math. Gazette. 37(321), https://doi.org/10.1017/S0025557200027455.Google Scholar
• IBM (2012) IBM ILOG CPLEX optimization studio. Accessed April 26, 2018, http://www.ibm.com/fr-fr/marketplace/ibm-ilog-cplex.Google Scholar
• Jefferson C, Miguel I, Hnich B, Walsh T, Gent IP (1999) CSPLib: A problem library for constraints. Accessed April 26, 2018, http://www.csplib.org/.Google Scholar
• Rossi F, Van Beek P, Walsh T, eds. (2006) Handbook of Constraint Programming (Elsevier, Amsterdam).Google Scholar
• Schulte C, Smolka G (2004) Finite domain constraint programming in Oz: A tutorial. Accessed April 26, 2018, http://mozart.github.io/.Google Scholar