0-1 Knapsack problems with a side constraint (Spanish)

In this paper the authors study 0-1 knapsack problems with an additional constraint. These kind of problems appear when formulating different lagrangean relaxations associated to integer programs. The authors have considered two kinds of problems: in the first ones both constraints are inequalities of the same type, while in the other problems the constraints are inequalities of different type. For both kinds of problems they present an implicit enumeration algorithm as well as heuristics to obtain feasible solutions. The efficiency of the proposed procedures has been tested with a wide computational experience whose results are reported.