This example is based on the well-known game called 'Sudoku'. The objective of the game is to fill every blocks, rows and columns with numbers 1 - 9 without any duplicates.
Besides regular MIP solve, this example also allows you to use some solvers, such as CPLEX and BARON, to find multiple solutions.
Mixed Integer Programming, Mixed Integer Formulations, Multiple Solutions, GMP Functions, Pivot Table.
A zip file with this example can be downloaded here.