INDEX TO EXAMPLES

CONSTRAINT LOGIC PROGRAMMING EXTENSIONS


Model file Represents
assign0.mod Job assignment problem, using n2 zero-one variables
assign1.mod . . . instead using n integer variables, with alldiff operator
balassign0.mod
balassign0.dat
Integer program for assignment of people to groups so that each group is "balanced" by various criteria
balassign1.mod
balassign1.dat
Constraint program for balanced assignment of people to groups, using the numberof operator
flowshp0.mod Flowshop problem, using n2 zero-one variables
flowshp1.mod . . . instead using n integer variables, with the or operator
flowshp2.mod . . . instead using n integer variables, with the ==> operator
grpassign0.mod
grpassign0.dat
grpassign0.run
Integer program for assignment of students to project groups
magic.mod Constraint program for finding a magic sequence of length n+1 (jth number in the sequence equals number of js in the sequence) using the numberof operator
mapcoloring.mod Constraint program for map coloring using inequality constraints
nqueens0.mod Integer program for the n queens problem: put n queens on an n-by-n chessboard so that no queen is attacking any other queen
nqueens.mod Constraint program for the n queens problem, using the alldiff operator
party1.mod
party1.dat
Constraint program for the progressive party problem, using alldiff, atmost, if-then, != as logic operators
party2.mod
party2.dat
Alternative constraint program using ==> "implies" operator, for a MIP formulation see E. Kalvelagen, Computers and Operations Research 30 (2003) 1713-1726
sched0.mod Job scheduling problem, using n2 zero-one variables
sched1.mod . . . instead using n integer variables, with the count operator
sched2.mod . . . instead using n integer variables, with the numberof operator
seq0.mod Job sequencing problem, using n2 zero-one variables
seq0a.mod Like seq0.mod, but using a set of objects for jobs
sudoku.mod
sudokuHard.dat
sudokuVeryEasy.dat
Sudoku solving model using the alldiff operator


Sources

flowshop: J.N. Hooker and M.A. Osorio, "Mixed Logical/Linear Programming." Technical report, Carnegie Mellon University, Pittsburgh, PA (July 1996).

seq: C. Jordan and A. Drexl, "A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups." ORSA Journal on Computing 7 (1995) 160-165.



Comments or questions?
Write to info@ampl.com or use our comment form.

Return to the AMPL proposed new features page.

Return to the AMPL update page.

Return to the AMPL home page.


LAST MODIFIED 7 FEBRUARY 1996 BY 4er@iems.nwu.edu.