List of Example Models¶
The project ships two parallel sets of example models.
Raw API examples¶
Package: org.maxicp.cp.examples.raw
These examples use MaxiCP’s raw implementation objects directly, giving full control over the CP solver internals. They are the closest to what you write when implementing custom constraints or search heuristics.
Example |
Description |
|---|---|
Capacitated Vehicle Routing with Time Windows. |
|
Dial-A-Ride Problem with ride-time constraints. |
|
Inventory Scheduling. |
|
Job-Shop scheduling with |
|
Magic Series. |
|
Magic Square. |
|
Maximum Independent Set. |
|
N-Queens with first-fail binary search. |
|
Nurse Scheduling. |
|
Perfect Square. |
|
Producer-consumer scheduling with |
|
Quadratic Assignment Problem with LNS. |
|
Resource-Constrained Project Scheduling with cumulative functions and FDS. |
|
SMIC. |
|
Send More Money. |
|
Ship Loading. |
|
Sport Scheduling. |
|
Traveling Salesman Problem. |
|
Traveling Salesman with Time Windows using a sequence variable. |
Modeling API examples¶
Package: org.maxicp.cp.examples.modeling
These examples use the high-level symbolic modeling API, which is then instantiated into raw CP objects. They are more concise and give access to the full range of MaxiCP features including embarrassingly parallel search.
Example |
Description |
|---|---|
CuSP. |
|
CVRPTW using the modeling API with insertion-based LNS. |
|
Dial-A-Ride Problem. |
|
Eternity II Puzzle. |
|
Flexible Job-Shop. |
|
Job-Shop with the modeling API. |
|
Magic Square. |
|
N-Queens using the |
|
Pickup and Delivery Problem. |
|
Perfect Square. |
|
Producer-Consumer. |
|
Quadratic Assignment Problem. |
|
RCPSP with the modeling API and FDS. |
|
SMIC. |
|
Ship Loading. |
|
Sport Scheduling. |
|
Stable Marriage. |
|
Steel Mill Slab. |
|
Traveling Salesman Problem. |
|
Traveling Salesman with Time Windows. |
We recommend using the modeling API for most use cases: it is more user-friendly, supports model transformations, and enables parallelization out of the box.