Advanced Constraint Programming with Java

This module transitions from basic backtracking search using the N-Queens Problem to introducing a more generic approach, culminating in the development of a declarative approach and creation of a basic CP library

This module covers the fundamentals of Mini-CP, a constraint programming library, exploring its core components including variables, domains, and state restoration mechanisms

This module explores two essential constraints used in CP problems, focusing on their filtering algorithms and properties, along with practical implementation techniques

This module introduces the table constraint, examining its applications and filtering algorithms as the most generic constraint type in constraint programming

This module examines the alldifferent global constraint, demonstrating how graph algorithms can be effectively integrated into constraint filtering

This module explores solving Vehicle Routing Problems using CP, focusing on the successor model and circuit global constraint, plus optimization techniques including Large Neighborhood search

This module introduces scheduling with CP, focusing on the cumulative constraint for managing non-preemptive tasks with resource requirements

This module covers scheduling problems with disjunctive resources where activities cannot overlap in time, including specific filtering and search techniques for solving job-shop problems

This module introduces problem-independent search heuristics based on the first-fail principle, focusing on efficient search techniques that can be applied across different problem domains

This module covers advanced modeling techniques for optimizing problem solving, including the implementation of redundant constraints and symmetry breaking