We examine ways to reformulate integer and mixed integer programs. Typically, but not
exclusively, one reformulates so as to obtain stronger linear programming relaxations, and …

Develo** a branching scheme that is compatible with the column generation procedure
can be challenging. Application specific and generic schemes have been proposed in the …

This paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum
Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that …

Many real-life planning and decision making problems can be formulated as mathematical
optimization models. Depending on the scope of the problem, finding good solutions can be …

A specialised case of the classical one-dimensional cutting stock problem (1D-CSP) with six
main additional features is adapted in this paper to model and solve planning unit …

This paper introduces a family of valid inequalities, which we term consistency cuts, to be
applied to a Dantzig-Wolfe reformulation (or decomposition) with linking variables. We prove …

Original equipment manufacturers (among others) from several industries experience the
vulcanising planning decision problem (VPDP) on a periodical basis. VPDP assumes …

Most integer programming problems can be formulated in several ways. Some formulations
are better suited for solution by exact methods, because they have either (i) a strong LP …

The vulcanising planning decision problem (VPDP) is a tactical periodically solved problem
that models a number of real world applications assuming tooling constrained capacity as …

This paper introduces a family of valid inequalities, that we term linking cuts, to be applied to
a Dantzig-Wolfe reformulation (or decomposition) with linking variables. We prove that these …