Represents

- Documentation
## DOCUMENTATION & RESOURCES

## OPEN SOURCE PROJECTS

- Products
- Learn
### Contact our support team

AMPL offers superior support by our development and technical support teams.

- About
### Contact Us

Contact us for general queries, partnerships, and more.

- Licenses & Pricing
### Not quite sure what license is right for you?

We can help you find the license and offering that works best for your situation.

- Products
- Learn
### Contact our support team

AMPL offers superior support by our development and technical support teams.

- About
### Contact Us

Contact us for general queries, partnerships, and more.

- Licenses & Pricing
### Not quite sure what license is right for you?

We can help you find the license and offering that works best for your situation.

This is a preliminary set of examples to offer some starting points for experimenting with AMPL’s “logic” and constraint programming interfaces. We welcome comments for improvements or other examples.

Represents

Model File

Constraint program for balanced assignment of people to groups, using the `numberof`

operator.

Model for map coloring using not-equals constraint.

`n` queens problem: put n queens on an `n`-by-`n` chessboard so that no queen is attacking any other queen.

Constraint program for the `n` queens problem, using the `alldiff` operator.

Open-shop scheduling model using disjunctive constraints to avoid job and machine conflicts.

`alldiff`, equivalence (`<==>`), and strict inequality (`<`)

Hoist scheduling model using disjunctive constraints

Model to solve instances of the 3 x 3 Sudoku problem, using the `alldiff` operator