The three-dimensional orthogonal packing problem consists of filling a big rectangular box with as many small rectangular boxes as possible. In a recent paper G. Fasano (Alenia Aerospazio, Turin) has given a mixed-integer programming formulation of this problem. Here we extend Fasano's...

The three-dimensional orthogonal packing problem consists of filling a big rectangular box with as many small rectangular boxes as possible. In a recent paper G. Fasano (Alenia Aerospazio, Turin) has given a mixed-integer programming formulation of this problem. Here we extend Fasano's...

The Faà di Bruno formula enables us to compute the derivatives of a function of several variables. We show here, in spite of the noncommutativity of causal computations, that the Faà di Bruno grammar makes it possible to compute the derivatives of any causal functional. Using this property and...

Combinatorial optimization problems arise in several areas ranging from management to mathematics and graph theory. Most combinatorial optimization problems are computationally hard due to the restriction that a subset of the variables have to take integral values. During the last two decades...

Combinatorial optimization problems arise in several areas ranging from management to mathematics and graph theory. Most combinatorial optimization problems are computationally hard due to the restriction that a subset of the variables have to take integral values. During the last two decades...

Several problems, including the long-range process design problem, have been formulated as a compatibility matrix. Earlier, Singhal et al. (1988) proposed a partial enumeration algorithm which found all feasible designs and reported computational results. However, for large problems, the partial...