We give characterizations of integral graphs in the family of complete split graphs and a few related families of graphs.

Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic chang...

Graffiti's conjecture 105 states that for any tree the range of transmissions of distance is greater than or equal to the range of degrees. After using the ...

Thrackleation of graphs and global optimization for quadratically constrained quadratic programming are used to find the octagon with unit diameter and larg...

Proposed just a few years ago, Variable Neighborhood Search (VNS) is a new metaheuristic for combinatorial and global optimization, based upon systematic ch...

Reduction of some classes of global optimization programs to bilinear programs may be done in various ways, and the choice of method clearly influences the ...

The <i>p</i>-Center problem consists in locating <i>p</i> facilities and assigning clients to them in order to minimize the maximum distance between a clien...

On the basis of a variable-neighbourhood search with the AutoGraphiX software, it is conjectured that for even numbers of atoms the fully conjugated acycli...

A fuzzy clustering problem consists in assigning a set of patterns to a given number of clusters with respect to some criteria such that each of them may be...

A generalization of the Roy-Gallai theorem is presented: it is based on the existence in any oriented graph of a stable set S such that for any node <i>w</i...

Maximum Clique is one of the most studied NP-hard optimization problem on graphs because of its simplicity and its numerous applications. A basic Variable N...

An algorithm with a complexity linear in the number of vertices is proposed for the computation of the Hyper-Wiener index of chemical trees. This complexity...

La Recherche à Voisinage Variable (RVV) est une métaheuristique récente basée sur l'idée d'un chargement systématique de voisinage, à la fois dans une phase...

The distance matrix of a chemical graph can be computed in quadratic time, and from it can be obtained the distance level patterns (DLP), Wiener, Szeged and...

We consider a given set of offshore platforms and onshore wells, producing known (or estimated) amounts of oil, to be connected to a port. Connections may t...

Given a set of logical sentences and probabilities that these sentences are true, the probabilistic logic problem consists in determining whethe...

Variable Neighborhood Search (VNS) is a recent metaheuristic which exploits systematically the idea of change of neighborhood within the search. After recal...

We review the work of B. Roy in graph theory and its posterity.

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

We modify the algorithm of Pardalos and Rodgers [40] for the minimization of a pseudo-boolean quadratic function by introducing an easy to compute lower bou...