- 'Explaining Circuit Propagation'. Authors: Kathryn Francis, Peter Stuckey [PDF]

Below is a MiniZinc model for each of the four variations of the tour design problem refered to in the paper, and a file containing the predicate definitions. In all variations of the problem the objective is to minimise the length of the longest leg in the tour.

- Tour must visit all locations (exactly once) and then return to the start location: circuit.mzn
- Tour must visit all locations, with no requirement to return to the start location: path.mzn
- Tour must visit at least one location providing each of a given set of activities, and then return to the start location: subcircuit.mzn
- Tour must visit at least one location providing each of a given set of activities (no requirement to return to the start location): subpath.mzn:
- Predicate definitions: circuitpreds.mzn

- Data files for circuit and path models (the same data files are applicable to both): circuit instances
- Data files for subcircuit and subpath models: subcircuit instances