Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV NEXT | FRAMES NO FRAMES

#

| ### Charles University in Prague Faculty of Mathematics and Physics # Constraint-based Timetabling API Documentation
### Prague, 2005 | ### Tomáš Müller

Iterative Forward Search
ifs | Iterative Forward Search Algorithm (root package)
ifs.dbt | Dynamic backtracking extension of IFS solver
ifs.extension | IFS Extensions (conflict-based statistics, maintenance of arc consistency)
ifs.heuristics | IFS Heuristics (value and variable selection criteria)
ifs.model | IFS Model (description of a problem)
ifs.perturbations | Minimal Perturbation Problem: counting of perturbations
ifs.solution | IFS Solution (also contains solution comparator)
ifs.solver | IFS Solver
ifs.termination | IFS Termination (termination condition)
ifs.util | Utilities

Iterative Forward Search Examples
ifs.example.csp | Random Binary CSP with uniform distribution.
ifs.example.jobshop | JobShop Problem.
ifs.example.rpp | Random Placement Problem.
ifs.example.tt | Simple Timetabling Problem.

Purdue University Timetabling
ttsolver | Purdue University Timetabling.
ttsolver.constraint | Purdue University Timetabling: Constraints.
ttsolver.heuristics | Purdue University Timetabling: Heuristics.
ttsolver.model | Purdue University Timetabling: Model.

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV NEXT | FRAMES NO FRAMES

Copyright © 2005 Tomáš Müller