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

DOI10.1007/BF01416225zbMath0721.90077OpenAlexW2022693390MaRDI QIDQ5753761

F. Donno, Giancarlo Pesamosca

Publication date: 1990

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01416225

zbMATH Keywords

Steiner problemnecessary and sufficient optimality conditionsminimal cost weighted treesubgradient type algorithmtwo-dimensional Weber problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

A fixed point algorithm for solving the Euclidean multifacility location problem in a tree ⋮ On the optimality conditions for the problem of minimizing a sum of euclidean norms ⋮ Nonmonotone bundle-type scheme for convex nonsmooth minimization

Cites Work

• Augmenting Euclidean Networks—the Steiner Case
• Technical Note—Location Theory: A Selective Bibliography
• Steiner Minimal Trees
• Convex Analysis
• Location Theory, Dominance, and Convexity
• Unnamed Item
• Unnamed Item

This page was built for publication: On the solution of the generalized steiner problem by the subgradient method