for computing a start vector for a local-search-based MINLP heuristic. We describe a dynamic block and column generation …, e.g. if the MINLP is block-separable, the CHR is equivalent to the convex hull relaxation obtained by (standard) column … generation (CG). The CHR can be used for computing an initial lower bound in the root node of a branch-and-bound algorithm, or …

A linear optimization problem which is amenable to column generation and contains a single parameter in the objective … function is considered. We extend and adapt the standard linear programming column generation scheme to effectively and … optimization and describe how the one-parametric column generation scheme can be used to form an outer approximation of the Pareto …