Given a set of logical sentences together with nonnegative weights assigned to each of them, the Maximum Weight Satisfiability problem (MAX-WEIGHT SAT) cons...

Ce papier présente une nouvelle procédure de classification, appelée PROCFTN, basée sur le domaine de l'aide multicritère à la décision. Le principe général...

In a research synthesis on the prognosis of depression, the outcome of interest has a multinomial distribution with the following typical categories: well, ...

The standard way to solve the static economic dispatch problem with transmission losses is the penalty factor method. The problem is solved iteratively by a...

Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and glo...

The aim of this paper is to provide a concise portrayal of medical applications of a new fuzzy classification method called PROAFTN, which uses a multicrite...

Weber's problem is to locate a facility in the Euclidean plane in order to minimize total transportation costs from that facility to a given set of users wi...

A model for the optimal location of new facilities in a competitive market is introduced under the hypothesis that customers' behavior can be modeled by ran...

Quatre regards sur la découverte, ceux du psychologue, de l'historien, du sociologue et du cognicien sont évoqués en quelques remarques illustrées d'exemples.

Mirkin's additive clustering (or qualitative factor analysis) algorithm explains similarities between entities by sequentially finding a cluster of entities...

It is shown that a geometrically planar fusene is uniquely determined by its boundary edge code. Surprisingly, the same conclusion is not true in general b...

Variable Neighborhood Search is a recent metaheuristic based on the idea of systematic change of neighborhood during both a descent phase and an exploration...

The definition of a fullerene as a cubic polyhedron made up entirely of pentagons and hexagons is compatible with a huge variety of isomeric forms for struc...

A new local search heuristic, called J-MEANS, is proposed for solving the minimum sum-of-squares clustering problem. The neighborhood of the current solut...

The recent Variable Neighborhood Search (VNS) metaheuristic combines local search with systematic changes of neighborhood in the descent and escape from loc...

Treatment of imprecise probabilities within the probabilistic satisfiability approach to uncertainty in knowledge-based systems is surveyed and discussed. ...

The probabilistic satisfiability problem consists, given <i>m</i> logical sentences, with their probabilities to find if they are coherent, and if it is the...

We discuss the relationship between probabilistic logic and <img src="pi.gif" align=bottom>-CMS. Given a set of logical sentences and probabilities, the ou...

An exact algorithm is proposed for minimum sum-of-squares nonhierarchical clustering, i.e., for partitioning a given set of points from Euclidean <i>m</i>-s...

Given a graph <i>G</i> with <i>n</i> vertices and stability number <img src="alpha.gif" align=bottom>(<i>G</i>), Turán's theorem gives a lower bound on the ...