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

This paper deals with the design and dimensioning of a novel survivable optical network structure, called Petaweb, that can reach a total capacity of severa...

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

Many time series encountered in real applications display seasonal behavior. In this paper, we consider multiplicative seasonal vectorial autoregressive movi...

Given a graph <i>G=(V,E)</i>, the first Zagreb index <i>M</i>₁ is the sum of its vertices squared degrees and the second Zagreb index <i>M</i><sub...

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

This paper presents an efficient approach for realistic modelling of internal transport systems. The weakness of the former methods in tracking the traffic w...

This paper presents a new generic architecture for the implementation of an intelligent simulation-based real-time control in large-scale discrete-events sys...

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

<p>Today, OCS (Optical Circuit Switching) is still the only mature technology for optical transfer, even if it suffers from its coarse granularity under dyn...

<p>In this paper, we present a scalable and agile design for next generation optical backbone networks. We assume each node to be equipped with a MultiServic...

This chapter deals with an application of stochastic control or stochastic game methods to the design of optimal timing of climate policies. In the first par...

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

Given a set of entities associated with points in Euclidean space, minimum sum-of-squares clustering (MSSC) consist in partitioning this set into clusters su...

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