Purpose – Since developing efficient product-location strategies represents a critical issue in operations management, due to its impact on warehouses performance terms of both service level and operation costs, this paper aims focus possible improvements the allocation SKUs, numerically evaluating how these can lead reduction overall required warehouse space material handling times. Design/methodology/approach The undertaken approach focused translating management problem into vertex...

Purpose The purpose of this study is to show that the use CAM (cognitive analytics management) methodology a valid tool describe new technology implementations for businesses. Design/methodology/approach Starting from dataset recipes, we were able consumers through variant RFM (recency, frequency and monetary value) model. It has been possible categorize customers into clusters measure their profitability thanks customer lifetime value (CLV). Findings After comparing two machine learning...

In this article we present an experimental study of the properties webgraphs. We a large crawl from 2001 200M pages and about 1.4 billion edges, made available by WebBase project at Stanford, as well several synthetic ones generated according to various models proposed recently. investigate topological such graphs, including number bipartite cores strongly connected components, distribution degrees PageRank values some correlations; comparison against these measures.Our findings are that (i)...

Edge and vertex connectivity are fundamental concepts in graph theory. While they have been thoroughly studied the case of undirected graphs, surprisingly, not much has investigated for directed graphs. In this article, we study 2-edge problems graphs and, particular, consider computation following natural relation: We say that two vertices v w 2- edge-connected if there edge-disjoint paths from to . This relation partitions into blocks such all same block 2-edge-connected. Differently case,...

Edge and vertex connectivity are fundamental concepts in graph theory. While they have been thoroughly studied the case of undirected graphs, surprisingly not much has investigated for directed graphs. In this paper we study 2-edge problems graphs and, particular, consider computation following natural relation: We say that two vertices v w 2-edge-connected if there edge-disjoint paths from to v. This relation partitions into blocks such all same block 2-edge-connected. Differently case,...

Programming Contests are a special branch in the general area of training and education programming support cover an important role computer science. Rather than direct provision concepts exercises related to programming, main concern is on algorithms data structures managed while composing solution problem, quality program itself. Training via web for contests mainly comprised activity producing solutions problems offered by online system (online platforms), whereas program, submitted...

The betweenness centrality of a node is measure related to the number shortest path involved with. It is, indeed, importance in network, and recent years has been used intensively for network analysis. major drawback this its high computational cost, thus literature several works appeared providing ways approximating it, presenting trade off between accuracy speed. articulation points connected are nodes whose removal disconnects critical core, i.e. subset obtained by repeatedly pruning low...

Current route planning algorithms for public transport networks are mostly based on timetable information only, i.e., they compute shortest routes under the assumption that all transit vehicles (e.g., buses, subway trains) will incur in no delays throughout their trips. Unfortunately, unavoidable and unexpected often prevent to respect originally planned schedule. In this paper, we try measure empirically quality of solutions offered by timetabling routing a real network, where unpredictable...

In this paper we present the first algorithm in streaming model to characterize completely biconnectivity properties of undirected networks: articulation points, bridges, and connected biconnected components. The motivation our work was development a real-time monitor connectivity Autonomous Systems (AS) Network, but solution provided is general enough be applied any network. network structure represented by graph, analyzed datastream framework. Here, as \emph{on-line} model, input graph...