My AIMMS+CP page
AIMMS is an optimization system developed by Paragon Decision Technology, featuring a GUI and much support of Operations Support tools.
For more information about AIMMS, see
2012-11-23: I wrote a long blog post about AIMMS+CP: A first look at AIMMS+CP (AIMMS with Constraint Programming).
My AIMMS+CP models
Here are my AIMMS+CP models, many originally written in the Summer 2011. Around mid September 2012, I re-checked (and re-modelled) these with AIMMS version 3.13 (beta). Thanks to Chris Kuip for comments, suggestions and improvements. All of the following models (perhaps with some exceptions) use the new released CP feature in AIMMS (called AIMMS+CP) using ILOG CPSolver as the constraint solver.
All models/projects links to two files: the AIM (.aim) file which is a textual representation of variables, constraints etc (but not anything GUI-related), and the project file (.aimmpack) which is the project file including everything, including the GUI definitions etc.
- AllDifferentExcept0.aimmspack: Alldifferent except 0, AllDifferentExcept0.aim
- AllInterval.aimmspack: All Interval, AllInterval.aim
- BinPackingTest.aimmspack: Binpacking test, BinPackingTest.aim
- CoinsGridCP.aimmspack Coins grid, CP only version, CoinsGridCP.aim
- CoinsGridCPMIP.aimmspack Coins grid, both CP and MIP version, CoinsGridCPMIP.aim
- Diet.aimmspack: Simple diet problem, Diet.aim
- DivisibleBy9Through1Chris.aimmspack: Divisible by 9 through 1, DivisibleBy9Through1.aim
- FurnitureMoving.aimmspack: Furniture moving, scheduling, FurnitureMoving.aim
- Langford.aimmspack: Langford, Langford.aim
- LeastDiff.aimmspack: Least Diff, LeastDiff.aim
- MagicSequence.aimmspack: Magic sequence, MagicSequence.aim
- MagicSquare.aimmspack: Magic square, MagicSquare.aim
- MagicSquareWaterRetention.aimmspack: Magic square Water Retention (with Frénicle normal form for symmetry breaking), MagicSquareWaterRetention.aim
- Map.aimmspack: Map problem, Map.aim
- Map2.aimmspack: Map problem, alternative version, Map2.aim
- Marathon.aimmspack: Marathon logic problem, Marathon.aim
- Marathon2.aimmspack: Marathon logic problem, different approach, Marathon2.aim
- Marathon3.aimmspack: Marathon logic problem, different approach suggested by Chris Kuip, Marathon3.aim
- Minesweeper.aimmspack: Minesweeper, Minesweeper.aim
- NQueens.aimmspack: N-queens problem, decomposition, slower, NQueens.aim
- NQueens2.aimmspack: N-queens problem, 3 alldifferent approach, faster, NQueens2.aim
- PlaceNumberPuzzle.aimmspack: Place number puzzle, PlaceNumberPuzzle.aim
- QuasigroupCompletion.aimmspack: Quasigroup completion, QuasigroupCompletion.aim
- SendMoreMoney.aimmspack: SEND+MORE=MONEY, SendMoreMoney.aim
- SendMoreMoney2.aimmspack: SEND+MORE=MONEY, alternative version, SendMoreMoney2.aim
- SendMostMoney.aimmspack: SEND+MOST=MONEY and optimize MONEY, SendMostMoney.aim
- SequenceTest.aimmspack: Sequence test, SequenceTest.aim
- Seseman.aimmspack: Seseman problem, Seseman.aim
- SetCovering.aimmspack: Simple set covering problem (Winston), SetCovering.aim
- Sudoku2.aimmspack: Sudoku, alternative version, Sudoku2.aim
- SurvoPuzzle.aimmspack: Survo Puzzle, SurvoPuzzle.aim
- TableTest.aimmspack: A simple version of Table constraint, using FORALL, TableTest.aim
- Tomography.aimmspack: Discrete Tomography, Tomography.aim
- WhoKilledAgatha.aimmspack: Who Killed Agatha (logic problem), WhoKilledAgatha.aim
- Xkcd.aimmspack: Xkcd "knapsack" problem, Xkcd.aim
Also, see my other pages about constraint programming systems:
* My Constraint Programming Blog
* Constraint Programming
* Common constraint programming problems
* My MiniZZinc page
* My Zinc page
* My JaCoP page
* My JaCoP/Scala page
* My Choco page
* My Gecode/R page
* My Comet page
* My Gecode page
* My Gecode/R page
* My ECLiPSe page
* My Essence'/Tailor/Savile Row page
* My SICStus Prolog page
* My Google or-tools (CP Solver) page
* My OscaR page
* My JSR-331 page
* My Numberjack page
* My B-Prolog page
* My Choco3 page
* My Picat page
Back to my homepage
Created by Hakan Kjellerstrand hakank@gmail.com