Cross-country learning from patents: an analysis of citations flows in innovation trajectories

AbstractThis study proposes a methodological approach to investigate cross-country creativity/knowledge flows by analyzing patent citation networks, taking the aircraft, aviation and cosmonautics (AAC) industry as a case study. It aims at shedding some light on the following research questions: (a) how cross-country creative/learning flows can be investigated; (b) have countries of current patent owners benefited from patent acquisitions. In fact, despite the well-established economic interest for (analyzing and forecasting) innovation trajectories, this research area is still unexplored, thus, motivating the need for such study. Over 43,000,000 patents have been analyzed whereby: (a) owners have performed cross-country patent acquisitions; (b) acquired patents (granted within 2005–2009) are cited by subsequent patents (2010–2015). Methodology and results are scalable to other industries and can be exploited by managers and policy makers to: (a) help firms forecasting innovation trajectories; (b) support governments in designing/implementing measures nurturing patented innovations in industries deemed relevant to national interest

Mixed Capacitated General Routing Problem Investigations

Dottorato di Ricerca in Ricerca Operativa 4 XXII Ciclo,2007-2009Università della Calabri

Parallel asynchronous labelcorrecting methods for shortest paths

Abstract. In this paper we develop parallel asynchronous implementations of some known and some new label correcting methods for finding a shortest path from a single origin to all the other nodes of a directed graph. We compare these implementations on a shared memory multiprocessor, the Alliant FX/80, using several types of randomly generated problems. Excellent (sometimes superlinear) speedup is achieved with some of the methods, and it is found that the asynchronous versions of these methods are substantially faster than their synchronous counterparts

Il Problema del VMI: un approccio risolutivo basato sul metodo di decomposizione

Dottorato di Ricerca in Ricerca operativa, Ciclo XXI, a.a. 2006-2008Università della Calabri

Schedulazione di agenti in un Call Center Multiskill

Dottorato di Ricerca in Ricerca Operativa, Ciclo XX, a.a. 2007-2008Università della Calabri

Robust scheduling of parallel machines with sequence-dependent set-up costs

In this paper we propose a robust approach for solving the scheduling problem of parallel machines with sequence-dependent set-up costs. In the literature, several mathematical models and solution methods have been proposed to solve such scheduling problems, but most of which are based on the strong assumption that input data are known in a deterministic way. In this paper, a fuzzy mathematical programming model is formulated by taking into account the uncertainty in processing times to provide the optimal solution as a trade-off between total set-up cost and robustness in demand satisfaction. The proposed approach requires the solution of a non-linear mixed integer programming (NLMIP), that can be formulated as an equivalent mixed integer linear programming (MILP) model. The resulting MILP model in real applications could be intractable due to its NP-hardness. Therefore, we propose a solution method technique, based on the solution of an approximated model, whose dimension is remarkably reduced with respect to the original counterpart. Numerical experiments conducted on the basis of data taken from a real application show that the average deviation of the reduced model solution over the optimum is less than 1.5%