In this paper, we formalize the simultaneous slot allocation problem. It is an extension of the problem currently tackled for allocating airport slots: it deals with all airports simultaneously and it enforces the respect of airspace sector capacities. By solving this novel problem, the system...

In this paper the use of Artificial Neural Networks (ANNs) in on-line booking for hotel industry is investigated. The paper details the description, the modeling and the resolution technique of on-line booking. The latter problem is modeled using the paradigms of machine learning, in place of...

The optimal control problem of determining advertising efforts for a seasonal good in a heterogeneous market is considered. We characterize optimal advertising exposures under different conditions: the general situation in which several wide-spectrum media are available, under the assumption of...

Despite the effects of the crisis, several studies show that there has been an increase in cultural production in all the most important western countries over the last twenty years. Nevertheless, the dimensions of the flows of demand are changing: the lowering of the threshold of perceived...

We consider a team of agents with limited problem-solving ability facing a disjunctive task over a large solution space. We provide sufficient conditions for the following four statements. First, two heads are better than one: a team of two agents will solve the problem even if neither agent...

We propose a class of preconditioners, which are also tailored for symmetric linear systems from linear algebra and nonconvex optimization. Our preconditioners are specifically suited for large linear systems and may be obtained as by-product of Krylov subspace solvers. Each preconditioner in...

In this paper we consider the parameter dependent class of preconditioners M(a,d,D) defined in the companion paper The latter was constructed by using information from a Krylov subspace method, adopted to solve the large symmetric linear system Ax = b. We first estimate the condition number of...

We study a general preferential attachment and Pólya's urn model. At each step a new vertex is introduced, which can be connected to at most one existing vertex. If it is disconnected, it becomes a pioneer vertex. Given that it is not disconnected, it joins an existing pioneer vertex with...