The crisscross space is rectangularly structured. Start from a Cartesian coordinate system with distance D of points defined as D(P1, P,)=Ixz-x,I+Jy2-y,I, where P,=(xr,y,) and P,(x,, yz) are points in the real plane. The general Steiner problem is to find the minimum point P of @(P)=~~=l ciD (P,, p
The general Steiner problem in Boolean space and application
✍ Scribed by Shou-Tien Ting; Shu-Yü Zhoa
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 659 KB
- Volume
- 90
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The Steiner Problem in Graphs (SP) is the problem of finding a set of edges with minimum total weight which connects a given subset of nodes in an edge-weighted (undirected) graph. In the more general Node-weighted Steiner Problem (NSP) also node weights are considered. A restricted minimum spanning
Given is an undirected graph with positive or negative edge weights which represent a profit if an investment such as installing a gas pipe takes place in a given time period. A certain part of the graph may already be piped in previous periods. The task is to extend the piped subgraph in the most p
In this paper, we give sufficient conditions for the upper semicontinuity property of the solution mapping of a general model which includes many generalized vector quasiequilibrium problems with set-valued maps as special cases. The main result generalizes and improves several recent results. An ex