Puzzle—More Logic Puzzle Apps Solved by Mathematical Programming

Published Online:https://doi.org/10.1287/ited.2019.0212

References

  • Bartlett A, Chartier TP, Langville AN, Rankin, TD (2008) Integer programming model for the Sudoku problem. J. Online Math. Appl. 8(May):1–14.Google Scholar
  • Chlond MJ (2005) Classroom exercises in IP modeling: Su Doku and the log pile. INFORMS Trans. Ed. 5(2):77–79.LinkGoogle Scholar
  • Chlond MJ (2010) Knight domination of 2-D surfaces: A spreadsheet approach. INFORMS Trans. Ed. 10(2):98–101.LinkGoogle Scholar
  • Chlond MJ (2014) Logic grid puzzles. INFORMS Trans. Ed. 15(1):166–168.LinkGoogle Scholar
  • Chlond MJ, Toase CM (2002) IP modeling of chessboard placements and related puzzles. INFORMS Trans. Ed. 2(2):1–11.LinkGoogle Scholar
  • Conrad A, Hindrichs T, Morsy H, Wegener I (1994) Solution of the knight’s Hamiltonian path problem on chessboards. Discrete Appl. Math. 50(2):125–134.CrossrefGoogle Scholar
  • Hartmann S (2018) Solving smartphone puzzle apps by mathematical programming. INFORMS Trans. Ed. 18(2):127–141.LinkGoogle Scholar
  • Hillier FS, Lieberman GJ (2001) Introduction to Operations Research, 7th ed. (McGraw-Hill, New York).Google Scholar
  • Holyer I (1981) The NP-completeness of edge-colouring. SIAM J. Comput. 10(4):718–720.CrossrefGoogle Scholar
  • Koch T (2006) Rapid mathematical programming or how to solve Sudoku puzzles in a few seconds. Haasis H-D, Kopfer H, Schönberger J, eds. German Oper. Res. Proc. 2005 (Springer, Berlin), 21–26.Google Scholar
  • Letavec C, Ruggiero J (2002) The n-queens problem. INFORMS Trans. Ed. 2(3):101–103.LinkGoogle Scholar
  • Lin S-S, Wei C-L (2005) Optimal algorithms for constructing knight’s tours on arbitrary × chessboards. Discrete Appl. Math. 146(3):219–232.CrossrefGoogle Scholar
  • Makhorin A (2010) Modeling Language GNU MathProg: Language Reference for GLPK Version 4.45 (Free Software Foundation, Boston).Google Scholar
  • Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J. ACM 7(4):326–329.CrossrefGoogle Scholar
  • Oki E (2012) Linear Programming and Algorithms for Communication Networks: A Practical Guide to Network Design, Control, and Management (CRC Press, Boca Raton, FL).CrossrefGoogle Scholar
  • Rasmussen RA, Weiss HJ (2007) Advanced lessons on the craft of optimization modeling based on modeling Sudoku in Excel. INFORMS Trans. Ed. 7(3):228–237.LinkGoogle Scholar
  • Weiss HJ, Rasmussen RA (2007) Lessons from modeling Sudoku in Excel. INFORMS Trans. Ed. 7(2):178–184.LinkGoogle Scholar
  • Yeomans JS (2003) Solving “Einstein’s riddle” using spreadsheet optimization. INFORMS Trans. Ed. 3(2):55–63.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.