Most heuristics for the Steiner tree problem in the Euclidean plane perform a series of
iterative improvements using the minimum spanning tree as an initial solution. We may …

The Steiner problem is an NP-hard optimization problem which consists of finding the
minimal-length tree connecting a set of N points in the Euclidean plane. Exact methods of …

Steiner minimum tree problem on a graph, ie, finding a tree with the minimum weight that
covers the set of terminal nodes, is a classical NP-hard problem. Thus, we develop a method …

We describe an effective optimization strategy that is capable of discovering innovative cost-
optimal designs of complete ascent assembly structures. Our approach relies on a …

One of the fundamental problems encountered during the VLSI design flow is to find
minimum length nets that connect specific nodes on the chip. The challenge lies in finding …

We present an effective optimization strategy that is capable of discovering high-quality cost-
optimal solution for two-dimensional (2D) path network layouts (ie, groups of obstacle …

We present an effective optimization strategy that is capable of discovering high-quality cost-
optimal solution for two-dimensional (2D) path network layouts (ie, groups of obstacle …

There is a set of points V= v 1, v 2,…, vn on a Euclidean plane, and the cost of the links
between any two points on the plane is Euclidean distance metric. The Steiner tree problem …

Multi-Objective Optimal Design of Obstacle-Avoiding Two-Dimensional Steiner Trees With
Application to Ascent Assembly Engineerin Page 1 Alexandru-Ciprian Z avoianu1 Department of …

Subjective contours are amongst the most interesting of visual illusions, and involve a
perceptual completion of an incomplete image. We first look at dot patterns which give the …