Puzzle—The Fillomino Puzzle

References

• Applegate D, Bixby R, Chvátal V, Cook W (2001) TSP Cuts Which Do Not Conform to the Template Paradigm (Springer, Berlin), 261–303.Crossref, Google Scholar
• Barnhart C, Johnson E, Nemhauser G, Savelsbergh M (1998) Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3):316–329.Link, Google Scholar
• Chlond M (2005) Classroom exercises in ip modeling: Su doku and the log pile. INFORMS Trans. Ed. 5(2):77–79.Link, Google Scholar
• den Hertog D, Hulshof P (2006) Solving rummikub problems by integer linear programming. Comput. J. 49(6):665–669.Crossref, Google Scholar
• Gurobi Optimization Inc. (2015) The travelling salesman problem with integer programming and Gurobi. http://examples.gurobi.com/traveling-salesman-problem/.Google Scholar
• Gurobi Optimization Inc. (2016) Gurobi optimizer reference manual. http://www.gurobi.com.Google Scholar
• Meuffels W, den Hertog D (2010) Solving the battleship puzzle as an integer programming problem. INFORMS Trans. Ed. 10(3): 156–162.Link, Google Scholar
• Nikoli Co Ltd. (2008) Database of Japanese puzzles.Google Scholar
• Puzzle Baron (2016) Fillomino by Puzzle Baron. Accessed April 2016, http://fillomino.puzzlebaron.com.Google Scholar
• Wilson J (1989) Crossword compilation using integer programming. Comput. J. 32:273–275.Crossref, Google Scholar
• Yen SJ, Su TC, Hsu SC (2011) An efficient algorithm for solving fillomino. 2011 IEEE Internat. Conf. Fuzzy Systems (FUZZ) (IEEE, Piscataway, NJ), 190–194.Crossref, Google Scholar