this repo has no description
dekker.one
1/***
2 @groupdef globals Global constraints
3
4 These constraints represent high-level modelling abstractions, for which
5 many solvers implement special, efficient inference algorithms.
6*/
7
8/***
9 @groupdef globals.alldifferent All-Different and related constraints
10
11 @groupdef globals.lexicographic Lexicographic constraints
12
13 @groupdef globals.sort Sorting constraints
14
15 @groupdef globals.channeling Channeling constraints
16
17 @groupdef globals.counting Counting constraints
18
19 @groupdef globals.packing Packing constraints
20
21 @groupdef globals.scheduling Scheduling constraints
22
23 @groupdef globals.graph Graph constraints
24
25 @groupdef globals.extensional Extensional constraints (table, regular etc.)
26*/
27
28include "all_different.mzn";
29include "alldifferent_except_0.mzn";
30include "all_disjoint.mzn";
31include "all_equal.mzn";
32include "alternative.mzn";
33include "among.mzn";
34include "among_fn.mzn";
35include "arg_sort.mzn";
36include "arg_min.mzn";
37include "arg_max.mzn";
38include "at_least.mzn";
39include "at_most.mzn";
40include "at_most1.mzn";
41include "bin_packing.mzn";
42include "bin_packing_capa.mzn";
43include "bin_packing_load.mzn";
44include "bin_packing_load_fn.mzn";
45include "bounded_path.mzn";
46include "circuit.mzn";
47include "connected.mzn";
48include "cost_mdd.mzn";
49include "cost_regular.mzn";
50include "count.mzn";
51include "count_fn.mzn";
52include "count_eq.mzn";
53include "count_neq.mzn";
54include "count_geq.mzn";
55include "count_gt.mzn";
56include "count_leq.mzn";
57include "count_lt.mzn";
58include "cumulative.mzn";
59include "cumulative_opt.mzn";
60include "dag.mzn";
61include "decreasing.mzn";
62include "diffn.mzn";
63include "diffn_nonstrict.mzn";
64include "diffn_k.mzn";
65include "diffn_nonstrict_k.mzn";
66include "disjoint.mzn";
67include "disjunctive.mzn";
68include "disjunctive_strict.mzn";
69include "disjunctive_opt.mzn";
70include "disjunctive_strict_opt.mzn";
71include "distribute.mzn";
72include "distribute_fn.mzn";
73include "element.mzn";
74include "exactly.mzn";
75include "geost.mzn";
76include "global_cardinality.mzn";
77include "global_cardinality_fn.mzn";
78include "global_cardinality_closed.mzn";
79include "global_cardinality_closed_fn.mzn";
80include "global_cardinality_low_up.mzn";
81include "global_cardinality_low_up_closed.mzn";
82include "increasing.mzn";
83include "int_set_channel.mzn";
84include "inverse.mzn";
85include "inverse_fn.mzn";
86include "inverse_set.mzn";
87include "knapsack.mzn";
88include "lex_greater.mzn";
89include "lex_greatereq.mzn";
90include "lex_lesseq.mzn";
91include "lex_less.mzn";
92include "lex2.mzn";
93include "link_set_to_booleans.mzn";
94include "maximum.mzn";
95include "mdd.mzn";
96include "mdd_nondet.mzn";
97include "member.mzn";
98include "minimum.mzn";
99include "network_flow.mzn";
100include "neural_net.mzn";
101include "nvalue.mzn";
102include "nvalue_fn.mzn";
103include "partition_set.mzn";
104include "piecewise_linear.mzn";
105include "range.mzn";
106include "range_fn.mzn";
107include "reachable.mzn";
108include "regular.mzn";
109include "regular_nfa.mzn";
110include "regular_set.mzn";
111include "regular_regexp.mzn";
112include "roots.mzn";
113include "roots_fn.mzn";
114include "sliding_sum.mzn";
115include "sort.mzn";
116include "sort_fn.mzn";
117include "span.mzn";
118include "steiner.mzn";
119include "strictly_decreasing.mzn";
120include "strictly_increasing.mzn";
121include "strict_lex2.mzn";
122include "subcircuit.mzn";
123include "subgraph.mzn";
124include "sum_pred.mzn";
125include "sum_set.mzn";
126include "symmetric_all_different.mzn";
127include "table.mzn";
128include "tree.mzn";
129include "value_precede.mzn";
130include "value_precede_chain.mzn";
131include "weighted_spanning_tree.mzn";