In several companies such as large retail stores, the employees perform different activities (e.g., cashier or clerk in a specific department) to respond to ...

Relationships between the diameter of a set of <i>n</i> points in the plane at mutual distance at least one, the diameter of an equilateral <i>n</i>-gon and ...

We present a new general variable neighborhood search approach for the uncapacitated single allocation <i>p</i>-hub median problem in networks. This NP-hard ...

In this paper, we propose a generic model based on linear programming that allows building an optimal production plan for a work shift in an open-pit mine. T...

Cet article propose une nouvelle architecture générique pour l'implantation d'un système intelligent de contrôle en temps réel basé sur la simulation dans de...

In this paper, we study the split delivery vehicle routing problem with time windows SDVRPTW that is a variant of the well-known vehicle routing problem with...

In this study, we compare various computational approaches to Bayesian small area estimation of proportions in logistic regression models. The basic idea con...

The modularity maximization model proposed by Newman and Girvan for the identification of communities in networks works for general graphs possibly with loop...

A total dominating set in a digraph <i>G</i> is a subset <i>W</i> of its vertices such that every vertex of <i>G</i> has an immediate successor in <i>W</i>. ...

A new hierarchical divisive algorithm is proposed for identifying communities in complex networks. To that effect, the definition of <i>community in the weak...

Using the AutoGraphiX system, we obtain conjectures of the form <img src="/cgi-bin/mimetex.cgi?l(n) \leq q_1 \oplus i(G)\leq u(n)"> where <img src="/cgi-bin...

Let <i>G</i> be a connected graph of order <i>n</i>. The algebraic connectivity of <i>G</i> is the second smallest eigenvalue of the Laplacian matrix of <i>G...

This study investigated the influence of working memory capacity on the dynamics of text composition from source, notably the strategy used by writers to con...

In this article we find the optimal solution of the hedging problem in discrete time by minimizing the mean square hedging error, when the underlying assets ...

A crew pairing is a sequence of flights, connections and rests that start and end at a crew base and is assigned to a single crew. The crew pairing problem c...

This paper investigates design methods of protection schemes in survivable WDM networks which use pre-configured protection structures (<i>p</i>-structures) ...

This study analyzes the use of neural network to produce accurate forecasts of total bookings and cancellations before departure, of a major rail operator. ...

A challenge in many applications of non-parametric curve estimation is that the function must satisfy some (lower and/or upper) variable order constraints (f...

In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search....

In this article, we construct a Malliavin derivative for functionals of a square-integrable Lévy process. The Malliavin derivative is defined via chaos expan...