Reduced RLT constraints are a special class of Reformulation-Linearization Technique (RLT) constraints. They apply to nonconvex (both continuous and mixed-...

Given a set of entities, cluster analysis aims at finding subsets, also called clusters or communities or modules, entities of which are homogeneous and well...

Finding clusters, or communities, in a graph, or network is a very important problem which arises in many domains. Several models were proposed for its solu...

Le secteur économique du transport aérien de passagers est soumis à de fortes contraintes dues aux nouveaux acteurs dans le domaine qui tendent les prix vers...

The MaxSumSum (maximum diversity) problem consists of the selection of <i>p</i> facilities among <i>n</i> candidate locations in a way that the total sum ...

Dispersion problems consist of the selection of a fixed number of vertices from a given set so that some function of the distances among the vertices is maxi...

Current network planning and design methods use the average delay, packet loss and throughput as metrics to optimize the network cost and performance. New...

We present ACRE, an Automatic aspeCt cREator, to use aspect-oriented programming to test multi-platform software programs written in C++. ACRE allows devel...

We introduce a signless Laplacian for the distance matrix of a connected graph, called the <i>distance signless Laplacian</i>. We study the <i>distance signl...

We introduce a Laplacian for the distance matrix of a connected graph, called the <i>distance Laplacian</i> and we study its spectrum. We show the equivalenc...

In 1956, Nordhaus and Gaddum gave lower and upper bounds on the sum and the product of the chromatic number of a graph and its complement, in terms of the or...

Modularity maximization is extensively used to detect communities in complex networks. It has been shown however that this method suffers from a resolution l...

We study the problem of packing equal circles in a square from the mathematical programming point of view. We discuss different formulations, we analyse fo...

In a recent paper, Zhan, Zhang, Guan, and Zhou [Phys. Rev. E <b>83</b>, 066120 (2011)] presented a modified adaptive genetic algorithm (MAGA) tailored to the...

In chemical graph theory, many graph parameters, or topological indices, were proposed as estimators of molecular structural properties. Often several varian...

It is well known that some local search algorithms for <i>K</i>-clustering problems could stop at a solution with fewer clusters than the desired <i>K</i>....

Given a graph <i>G</i> and a bipartition of its vertices, the edge-ratio is the minimum for both classes so defined of their number of internal edges divid...

The GRIEG model is a hybrid model of demo-economic projections that combines two approaches: the econometric approach - based on the micro-economy - of the N...

Community detection in networks based on modularity maximization is currently done with hierarchical divisive or agglomerative as well as with partitioning h...

Heuristics are widely applied to modularity maximization models for the identification of communities in complex networks. We present an approach to be appli...