Given a fleet of vehicles assigned to a single depot, the vehicle routing problem with time windows (VRPTW) consists of determining a set of feasible v...

Since its appearance in 1947, the primal simplex algorithm has been one of the most popular algorithm for solving linear programs. It is very efficient wh...

In the <i>Vehicle Routing Problem </i> (VRP), the aim is to design a set of <i>m</i> minimum cost vehicle routes through <i>n</i> customer locations, so that...

<p>On étudie à l'aide du système AutoGraphiX 2 (AGX 2) des relations de la forme </p>

<p><center> <img src="/cgi-bin/mimetex.cgi?\underline{b}_{n} \, \l...

Main methods, algorithms and applications of the Variable Neighborhood Search metaheuristic are surveyed, in view of a chapter of the <i>Encyclopedia of Opti...

Given a class of graphs <img src="/cgi-bin/mimetex.cgi?\mathcal{F}">, a forbidden subgraph characterization (FSC) is a set of graphs <img src="/cgi-bin/mimet...

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...

The <i>Capacitated Arc Routing Problem</i> (CARP) consists of determining a set of least cost capacitated vehicle routes servicing a set of arcs. In this p...

We consider a noncooperative differential game where a retailer sells her own private label in addition to the manufacturer’s brand. We assume that each bran...

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 paper we study the Capacitated Team Orienteering and Profitable Tour Problems (CTOP and CPTP). The interest in these problems comes from recent devel...

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...

An edge coloring of a graph <img src="/cgi-bin/mimetex.cgi?G = (V,E)"> is a function <img src="/cgi-bin/mimetex.cgi?c:E \rightarrow N"> that assigns a co...

We consider the problem of assigning patients to nurses for home care services. The aim is to balance the workload of the nurses while avoiding long travels...

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