Computing systems are rapidly changing with multicore, graphics processing units (GPUs), clusters, volunteer systems, clouds, and grids offering a confusing dazzling array of opportunities. New programming paradigms such as Google MapReduce and many-task computing have joined the traditional repertoire of workflow and parallel computing for the highest performance systems. Meanwhile, the life s...

Chung, S.-J., H.W. Hamacher, F. Maffioli and K.G. Murty, Note on combinatorial optimization with max-linear objective functions, Discrete Applied Mathematics 42 (1993) 139-145. We consider combinatorial optimization problems with a feasible solution set SC(O,I )” specified by a system of linear constraints in O-l variables. Additionally, several cost functions c,,., ,,c~ are given. The max-line...

The minimum weighted k-cardinality tree subgraph problem consists in finding, in a given undirected weighted graph G(V,E,W ), a tree T ⊆ E of k edges having minimal total weight among all of k-trees that are subgraphs of G. We will refer this problem as the Min W-k-Tree. This is combinatorial optimization problem first described by Hamacher, Jörnsten, and Maffioli in [HJM91] who also proved to ...

Abstract Tourism places substantial stress on regional land use that can lead to ecological deterioration, greater pollution, destruction of natural habitats, and increasing threats species already in danger extermination. Improved quality life is made possible through the Fuzzy Hamacher Correlated Geometric (FHCG) method observe growth multiple attributes a water-based leisure tourism eco-city...

In this article we highlight the application of Operations Research (OR) at BASF in the area of supply chain management (SCM) through the use of selected examples with annual cost savings ranging between several hundred thousand and several million e. We address special characteristics of the process industry that have to be dealt with and identify future research needs. The examples cover stra...

let $g$ be a connected graph. the multiplicative zagreb eccentricity indices of $g$ are defined respectively as ${bf pi}_1^*(g)=prod_{vin v(g)}varepsilon_g^2(v)$ and ${bf pi}_2^*(g)=prod_{uvin e(g)}varepsilon_g(u)varepsilon_g(v)$, where $varepsilon_g(v)$ is the eccentricity of vertex $v$ in graph $g$ and $varepsilon_g^2(v)=(varepsilon_g(v))^2$. in this paper, we present some bounds of the multi...

The first general Zagreb index is defined as $M_1^lambda(G)=sum_{vin V(G)}d_{G}(v)^lambda$. The case $lambda=3$, is called F-index. Similarly, reformulated first general Zagreb index is defined in terms of edge-drees as $EM_1^lambda(G)=sum_{ein E(G)}d_{G}(e)^lambda$ and the reformulated F-index is $RF(G)=sum_{ein E(G)}d_{G}(e)^3$. In this paper, we compute the reformulated F-index for some grap...