The Steiner tree problem (STP) in graphs is one of the most studied problems in
combinatorial optimization. Since its inception in 1970, numerous articles published in the …

Let us start with two examples. A company has a machine which drills holes into printed
circuit boards. Since it produces many of these boards it wants the machine to complete one …

Using insights from biological processes could help to design new optimization techniques
for long-standing computational problems. This paper exploits a cellular computing model in …

Abstract The Balanced Minimum Evolution Problem (BMEP) is an APX-hard network design
problem that consists of finding a minimum length unrooted binary tree (also called a …

The Steiner tree problem is one of the most important combinatorial optimization problems. It
has a long history that can be traced back to the famous mathematician Fermat (1601-1665) …

Connectivity is one of the most basic concepts of graph-theoretical subjects, both in a
combinatorial sense and in an algorithmic sense. As we know, the classical connectivity has …

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 …

We present an effective heuristic for the Steiner Problem in Graphs. Its main elements are a
multistart algorithm coupled with aggressive combination of elite solutions, both leveraging …

Motivated by the reconstruction of phylogenetic tree in biology, we study the full Steiner tree
problem in this paper. Given a complete graph G=(V, E) with a length function on E and a …

In the well-known Survivable Network Design Problem (SNDP), we are given an undirected
graph G with edge costs, a set R of terminal vertices, and an integer demand ds, t for every …