Module org.maxicp

Package org.maxicp.cp.examples.modeling


package org.maxicp.cp.examples.modeling
Examples of models using the symbolic modeling API
  • Class
    Description
    The Cumulative Scheduling Problem (CuSP) consists in scheduling a set tasks that share a resource with a fixed capacity.
     
    Model for the Dial-A-Ride Problem (DARP) using sequence variables.
    Data related to a node in the DARP problem
    The Eternity II puzzle is an edge-matching puzzle which involves placing 256 square puzzle pieces into a 16 by 16 grid, constrained by the requirement to match adjacent edges.
     
     
    The Magic Square problem.
     
    Perfect Square Problem The problem is to fully cover a big square with different smaller ones, with no overlap between them
    The Quadratic Assignment problem.
    Resource Constrained Project Scheduling Problem.
    !!!
     
     
     
     
    The problem is to schedule an even number n of teams over n/2 periods and n - 1 weeks, under the following constraints:
    - Each team must play against every other team
    - A team plays exactly one game per week
    - A team can play at most twice in the same period
    Stable Marriage problem: Given n women and n men, where each woman (resp. man) has ranked each man (resp. woman) with a unique number between 1 and n in order of preference (the lower the number, the higher the preference), say for summer internships, match the women and men such that there is no pair of a woman and a man who would both prefer to be matched with each other than with their actually matched ones.
    Steel is produced by casting molten iron into slabs.