✦ LIBER ✦

On the solution of the generalized steiner problem by the subgradient method

✍ Scribed by F. Donno; G. Pesamosca

Publisher: Springer
Year: 1990
Tongue: English
Weight: 730 KB
Volume: 34
Category: Article
ISSN: 0340-9422
DOI: 10.1007/bf01416225

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Numerical solution of sample minimizatio

Numerical solution of sample minimization problems by the ε-subgradient method

✍ A. I. Korablev; O. V. Mironov 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 349 KB

ɛ-Subgradient method for the solution of

ɛ-Subgradient method for the solution of nonlinear extremal problems

✍ A. I. Korablev 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 428 KB

On the solution of a generalized Stefan

On the solution of a generalized Stefan problem

✍ J. Greydanus; H. Rasmussen 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 755 KB

Solution of the generalized diffraction

Solution of the generalized diffraction problem

✍ T. B. Solomyak 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 531 KB

Dual Heuristics on the Exact Solution of

Dual Heuristics on the Exact Solution of Large Steiner Problems

✍ Marcus Poggi de Aragão; Eduardo Uchoa; Renato F. Werneck 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 333 KB

Some generalizations of the steiner prob

Some generalizations of the steiner problem in graphs

✍ C. W. Duin; A. Volgenant 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 562 KB

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