Search

Abstract: This paper describes a new Branch and Bound algorithm for the 0-1 Knapsack Problem (KP). The algorithm is based on the use of a Lagrangean Relax-and-Cut procedure that allows exponentially many Fractional Gomory Cuts and Extended Cover Inequalities to be candidates to Lagrangean dualization. In doing so, the upper bounds thus obtained are stronger than the standard Linear Programming relaxation bound for KP. The algorithm is aimed at solving instances with coefficients as large as 1015, a class of KP instance for which existing solution algorithms might not be directly applicable. [ABSTRACT FROM AUTHOR]

Focuses on a study which proposed an alternative mixed integer linear disjunctive formulation for transmission network expansion. Classical non-linear formulation of the transmission expansion problem; Disjunctive mixed integer formulation of the transmission expansion problem; Standard and alternative disjunctive models.