| 数独问题的整数规划模型 |
| |
| 引用本文： | 胡英武.数独问题的整数规划模型[J].金华职业技术学院学报,2011,11(3):86-88. |
| |
| 作者姓名： | 胡英武 |
| |
| 作者单位： | 金华职业技术学院,浙江金华,321007 |
| |
| 基金项目： | 浙江省教育厅科研项目，金华职业技术学院青年教改项目 |
| |
| 摘 要： | 数独是近年流行的一种益智游戏,其最常见模式是在一个n行×n列又再分成n区共n2个小格的方中,填入适当的数字,使每一行、每一列、每一区都含有数字1～n,不重复.运用0-1规划的方法建立数独问题的整数规划模型,给出了9阶数独模型求解的Lingo程序,最后对模型进行了评价。
|
| 关 键 词： | 数独 0-1规划 整数规划模型 |
An Integer Programming Model for the Sudoku Problem |
| |
| HU Ying-wu.An Integer Programming Model for the Sudoku Problem[J].Journal of Jinhua College of Profession and Technology,2011,11(3):86-88. |
| |
| Authors: | HU Ying-wu |
| |
| Institution: | HU Ying-wu(Jinhua Polytechnic,Jinhua 321007,China) |
| |
| Abstract: | Sudoku was a game with incremental intelligence and was popular in many countries.Its most common pattern was to fill the digits 1 through n into a square with n rows by n columns and subdivided n boxes,so that each digit appears once,and only once,in every row,column,and box.An integer programming model for the Sudoku problem was built up through the method of 0-1 programming,and then the lingo procedure was given to solve the model of n=9.Finally,the model was evaluated. |
| |
| Keywords: | Sudoku 0-1 programming integer programming model |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
