Upper bounds for products of four measures of distances in graphs: diameter, radius, average eccentricity and remoteness with three measures of connectivity:...

In the set of all connected graphs with a given domination number, we characterize the graphs which achieve the maximum value of the spectral radius of the ...

We show that among connected graphs with maximum clique size <img src="/cgi-bin/mimetex.cgi?\omega">, the minimum value of the spectral radius of adjacency m...

We present and compare three new compact linearizations for the quadratic 0-1 minimization problem, two of which achieving the same lower bound than the "sta...

Data clustering methods have been developed extensively in the data mining literature for detecting useful patterns in large datasets in the form of dense...

A set of vertices <i>S</i> in a graph <i>G</i> is a clique if any two of its vertices are adjacent. The clique number <img src="/cgi-bin/mimetex.cgi?\omega"...

In this survey, we examine an important class of facility location problems known as the multisource Weber problem (also referred to as the continuous locat...

A recent comparison of evolutionary, neural network, and scatter search heuristics for solving the p-median problem is completed by (i) gathering or obtaini...

We consider the bandwidth coloring problem, a generalization of the well-known graph coloring problem. For the latter problem, a classical theorem, discover...

The probabilistic satisfiability problem is to verify the consistency of a set of probability values or intervals for logical propositions. The (tight) prob...

A set of vertices <i>S</i> in a graph <i>G</i> is independent if no neighbor of a vertex of <i>S</i> belongs to <i>S</i>. A set of vertices <i>U</i> in a gr...

The AutoGraphiX 2 system is used to compare the index of a graph <i>G</i> with a number of other graph theoretical invariants, i.e., chromatic number, maxim...

Assouad has shown that a real-valued distance <i>d</i> = (<i>d</i>_<i>ij</i>) _{1 &le; <i>i</i> &lt; <i>j</i> &le; <i>n</i>} is isome...

A set of vertices <i>S</i> in a graph <i>G</i> is independent if no neighbor of a vertex of <i>S</i> belongs to <i>S</i>. The independence number &alpha is ...

Given a set of timetabled tasks, the multi-depot vehicle scheduling problem is a wellknown problem that consists of determining least-cost schedules for veh...

We consider four conjectures related to the largest eigenvalue of (the adjacency matrix of) a graph (i.e., to the index of the graph). Three of them have be...

Let &nbsp;<img src="/cgi-bin/mimetex.cgi?G=(V,E)">&nbsp; be a simple graph with vertex degrees &nbsp;<img src="/cgi-bin/mimetex.cgi?d1, d2, \ldots, d_n...

Let &nbsp;<img src="/cgi-bin/mimetex.cgi?G=(V,E)"> be a simple graph with &nbsp;<img src="/cgi-bin/mimetex.cgi?n=|V|"> vertices and &nbsp;<img src="/cgi-bin/...

Given a simple connected graph <i>G = (V,E)</i> the geodetic closure <i>I&nbsp;[S]</i> <img src="/cgi-bin/mimetex.cgi?\subset"> <i>V</i> of a subset <i>S</i...

The AutoGraphiX research program led to a new type of application of metaheuristics in graph theory, <i>i.e.</i>, finding conjectures on graph invariants by...