A mixed integer formulation for maximal covering by inclined parallelograms

In this paper, we introduce a zero–one mixed integer formulation for a maximal covering problem where points are covered by inclined parallelograms in a plane. The special case of covering rectangles with sides parallel to the axis is treated with a separate formulation. Finally, an alternative algorithm for solving covering by inclined parallelograms is presented. The formulations proposed can be easily adapted for other location and material cutting applications.