This paper describes the application of a simulated annealing approach to the solution of a complex portfolio selection model. The model is a mixed integer quadratic programming problem which arisesâ€¦ (More)

This paper investigates the complexity of a general inference problem: given a propositional formula in conjunctive normal form, find all prime implications of the formula. Here, a prime implicationâ€¦ (More)

We describe a consensus-type algorithm for determining all the maximal complete bipartite (not necessarily induced) subgraphs of a graph. We show that by imposing a particular order in which theâ€¦ (More)

This survey describes some of the main optimization problems arising in the context of production planning for the assembly of printed circuit boards. The discussion is structured around aâ€¦ (More)

Given a Boolean formula in disjunctive normal form, the variable deletion control set problem consists in finding a minimum cardinality set of variables whose deletion from the formula results in aâ€¦ (More)

The k-dimensional assignment problem with decomposable costs is formulated as follows. Given is a complete k-partite graph G = (X0 u ... u X,_ I, E), with lXil = p for each i, and a nonnegativeâ€¦ (More)

The basic algorithm of pseudo-Boolean programming due to Hammer and Rudeanu allows to minimize nonlinear O-l functions by recursively eliminating one variable at each iteration. We show it hasâ€¦ (More)