In this paper, some of the main known results relative to the generalized minimum spanning
tree problem are surveyed. The principal feature of this problem is related to the fact that the …

Network design problems (NDP) consist of identifying an optimal subgraph of a graph,
subject to side constraints. In generalized NDP, the vertex set is partitioned into clusters and …

We have developed a novel and versatile three-dimensional cellular automaton model of
brain tumor growth. We show that macroscopic tumor behavior can be realistically modeled …

Given a graph, the shortest-path problem requires finding a sequence of edges with
minimum cumulative length that connects a source vertex to a target vertex. We consider a …

Abstract In literature, Clustered Shortest-Path Tree Problem (CluSPT) is an NP-hard
problem. Previous studies focus on approximation algorithms which search for an optimal …

The frame approach for representing knowledge (ie, collection of frames are linked together
into frame-system) has been suggested by Marvin Minsky. In this approach, the frame …

Along with the development of manufacture and services, the problem of distribution network
optimization has been growing in importance, thus receiving much attention from the …

In this paper, we are addressing the generalized minimum spanning tree problem, denoted
by GMSTP, which is a variant of the classical minimum spanning tree (MST) problem. The …

Combinatorial optimization is a fascinating topic. Combinatorial optimization problems arise
in a wide variety of important fields such as transportation, telecommunications, computer …

The holy grail of tumor modeling is to formulate theoretical and computational tools that can
be utilized in the clinic to predict neoplastic progression and propose individualized optimal …