Assigning workers to machines: linear, 'all-different', and 'element' constraints;

• branching strategy for variables; consecutive solving with 2 different objectives; heuristic solution algorithm without enumeration (i1assign_ka.mos).
• User-defined search: definition of variable and value selection strategies (i1assign2_ka.mos).

Further explanation of this example: 'Xpress Kalis Mosel User Guide', Section 4.4 User-defined enumeration strategies

! Data file for `i1assign.mos'

OUTP: [13 24 31 19 40 29
       18 25 30 15 43 22
       20 20 27 25 34 33
       23 26 28 18 37 30
       28 33 34 17 38 20
       19 36 25 27 45 24]