We address the two-dimensional Knapsack Problem (2KP), aimed at packing a maximum-pro1t subset of rectangles selected from a given set into another rectangle. We consider the natural relaxation ofâ€¦ (More)

We are given a unique rectangular stock of material S, with height H and width W , and a list of m rectangular shapes to be cut from S. Each shapeâ€™s type i (i = 1, . . . ,m) is characterized by aâ€¦ (More)

Given an undirected graph G = (V , E), the Vertex Coloring Problem (VCP) requires to assign a color to each vertex in such a way that colors on adjacent vertices are different and the number ofâ€¦ (More)

High-sensitivity to initial conditions is generally viewed as a drawback of tree search methods, as it leads to an erratic behavior to be mitigated somehow. In this paper we investigate the oppositeâ€¦ (More)

Wesurvey themain results presented in the authorâ€™sPh.DThesis (Monaci 2001), discussed on January 2002 at the University of Bologna (Italy) and supervised by Paolo Toth and Silvano Martello. Theâ€¦ (More)

Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomoryâ€™s corner relaxation is obtained by dropping nonnegativityâ€¦ (More)