3.7.101. Flow

A constraint for which there is a filtering algorithm based on an algorithm that finds a feasible flow in a graph. This graph is usually constructedSometimes it is also constructed from the reformulation of a global constraint in term of a conjunction of linear constraints. This is for instance the case for the 𝚊𝚖𝚘𝚗𝚐_𝚜𝚎𝚚 and the 𝚜𝚕𝚒𝚍𝚒𝚗𝚐_𝚜𝚞𝚖 global constraints. from the variables of the constraint as well as from their potential values. The next sections provide standard flow models for the 𝚊𝚕𝚕𝚍𝚒𝚏𝚏𝚎𝚛𝚎𝚗𝚝, the 𝚘𝚙𝚎𝚗_𝚊𝚕𝚕𝚍𝚒𝚏𝚏𝚎𝚛𝚎𝚗𝚝, the 𝚐𝚕𝚘𝚋𝚊𝚕_𝚌𝚊𝚛𝚍𝚒𝚗𝚊𝚕𝚒𝚝𝚢_𝚕𝚘𝚠_𝚞𝚙, the 𝚐𝚕𝚘𝚋𝚊𝚕_𝚌𝚊𝚛𝚍𝚒𝚗𝚊𝚕𝚒𝚝𝚢_𝚕𝚘𝚠_𝚞𝚙_𝚗𝚘_𝚕𝚘𝚘𝚙, the 𝚞𝚜𝚎𝚍_𝚋𝚢, the 𝚜𝚊𝚖𝚎, and the 𝚜𝚊𝚖𝚎_𝚊𝚗𝚍_𝚐𝚕𝚘𝚋𝚊𝚕_𝚌𝚊𝚛𝚍𝚒𝚗𝚊𝚕𝚒𝚝𝚢_𝚕𝚘𝚠_𝚞𝚙 constraints.