The Traveling Salesman Problem and the Vehicle Routing Problem are two of the most popular problems in the field of combinatorial optimization. The purpose ...

As of April 2007, the European Union has new regulations concerning driver working hours. These rules force the placement of breaks and rests into the vehicl...

The <i>proximity</i> <img src="/cgi-bin/mimetex.cgi?\pi = \pi (G)"> of a connected graph <i>G</i> is the minimum, over all vertices, of the average distance ...

This paper presents a general framework for formulating cutting planes in the context of column generation for integer programs. Valid inequalities can be de...

We address the problem of locating in the plane objects such as segments, arcs of circumferences, arbitrary convex sets, their complements or their boundarie...

Harmonic means clustering is a variant of Minimum sum of squares clustering (which is sometimes called <i>K</i>-means clustering), designed to alleviate the ...

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

Let <i>Q = D + A</i> denote the signless Laplacian matrix of a graph <i>G</i> of order <i>n</i>, where <i>D</i> is the diagonal matrix of the degrees and <i...

The <i>Vehicle routing Problem</i> (VRP) was introduced 50 years ago by Dantzig and Ramser under the title "The Truck Dispatching Problem". The study of the ...

The paper provides a survey of the literature which utilizes dynamic state-space games to formulate and analyze intertemporal, many-decision maker problems i...

Given a set of scheduled flights that must be operated by the same aircraft type, the aircraft routing problem (ARP) consists of building anonymous aircraft ...

We consider in this paper a duopoly competing in quantities and where firms can invest in R&D to control their emissions. We distinguish between effort carri...

Khalifeh, Yousefi-Azari, Ashrafi and Wagner [European J. Combin. 30 (2009) 1149-1163] conjectured that for a connected graph <i>G</i> on <i>n</i> vertices...

The proximity <img src="/cgi-bin/mimetex.cgi?\pi"> of a graph <i>G</i> is the minimum average distance from a vertex of <i>G</i> to all others. Similarly, th...

This work analyzes constrained black box optimization in which the functions defining the problem are periodic with respect to some or all the variables. We ...

The paper revisits the advertising differential game suggested by G. Leitmann and W. E. Schmitendorf in their paper "Profit Maximization Through Advertising...

We propose a deterministic, discrete-time, finite-horizon oligopoly model to investigate investment and production equilibrium strategies, in a setting where...

In the <i>Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows</i>, the set of customers is the union of <i>delivery customers</i> and...

During the last three decades, the computer has been widely used in spectral graph theory. Many results about graph eigenvalues were first conjectured, and i...

The <i>improved primal simplex</i> (IPS) method has been proposed by Elhallaoui et al. (2008). We rewrite the theory of IPS for a cold start with an initial ...