Abstract :
Summary form only given. This article consists of a collection of slides from the author´s PowerPoint conference presentation. It is concluded that the standard disjunctive formulation allows using classical combinatorial optimization techniques and therefore guarantees obtaining optimal solutions, contrarily to the nonlinear formulation. An alternative disjunctive formulation was proposed which is better conditioned giving significant reduction of computational effort. The upper bound provided by GRASP metaheuristic allows solving hard problem instances and even proving optimality by reducing the B&B search tree.
