An all-different constraint for a given family of discrete variables imposes the condition that no two variables in the family are allowed to take the same value. Magos et al. [Mathematical Programming, 132 (2012), pp. 209–260] gave a linear-inequality description of the convex hull of...

Recently there has been considerable research on simple mixed-integer sets, called mixing sets, and closely related sets arising in uncapacitated and constant capacity lot- sizing. This in turn has led to study of more general sets, called network-dual sets, for which it is possible to derive...

The cut polyhedron cut(G) of an undirected graph G = (V, E) is the dominant of the convex hull of all of its nonempty edge cutsets. After examining various compact extended formulations for cut(G), we study some of its polyhedral properties. In particular, we characterize all of the facets...