Nilsson recently introduced a rigorous semantic generalization of logic in which the truth values of sentences are probability values. This led to state pre...

The computation of penalties associated with the continuous relaxation of integer programming problems can be useful to derive conditional and relational te...

Timonov proposes an algorithm for global maximization of univariate Lipschitz functions in which successive evaluation points are chosen in order to ensure ...

Divisive hierarchical clustering algorithms with the diametercriterion proceed by recursively selecting the cluster with largest diameter and partitioning i...

We study the complexity and propose an algorithm for the problem of determining, given <i>p</i> vectors of {-1, 1}<i>ⁿ</i>, all linear combinatio...

Consider <i>N</i> entities to be classified, with given weights, and a matrix of dissimilarities between pairs of them. The split of a cluster is the small...

Several authors have proposed to estimate Lipschitz constants in global optimization by a multiple of the largest slope (in absolute value) between successi...

We show that the satisfiability and maximum satisfiability problems can be transformed into set covering problems at the expense of acceptable increase of s...

We propose a new algorithm to solve the on-line vertex enumeration problem for polytopes, doing all computations in <i>n</i>-space, where <i>n</i> is the di...

We consider the following global optimization problems for a Lipschitz function <i>f</i> implicitly defined on an interval [<i>a,b</i>]. Problem <i>P'</i>:...

We consider the following global optimization problems for a univariate Lipschitz function <i>f</i> defined on an interval [<i>a,b</i>]: Problem <i>P</i>: f...

FORTRAN code of an efficient implementation of a <img src="Theta.gif" align=bottom> (<i>N</i>₂) algorithm for the maximum sum-of-splits clusterin...

Global optimization problems with a few variables and constraints arise in numerous applications but are seldom solved exactly. Most often only a local opti...

Piyavskii's algorithm maximizes a univariate function <i>f</i> satisfying a Lipschitz condition. We compare the numbers of iterations needed to obtain a bou...

Consider <i>N</i> entities to be classified, and a matrix of dissimilarities between pairs of them. The split of a cluster is the smallest dissimilarity be...

We study the design problem of part-orienting systems which are often employed in many manufacturing environments to orient parts of assembly or to perform o...

The Basic Algorithm of pseudo-Boolean programming due to Hammer and Rudeanu allows to minimize nonlinear 0-1 functions by recursively eliminating one variabl...

An experimental computer system for globally optimal design, called BAGOP, is discussed. This new tool uses the computer alebra system MACSYMA to implement ...

Many problems of globally optimal design have been solved in the literature using monotonicity analysis and a variety of tests applied in an ad hoc way. The...

Many problems of globally optimal design have been solved by using monotonicity analysis. New monotonicity principles are obtained by exploiting non strict ...