On the solution of the generalized steiner problem by the subgradient method
From MaRDI portal
Publication:5753761
DOI10.1007/BF01416225zbMath0721.90077MaRDI QIDQ5753761
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
Steiner problem; necessary and sufficient optimality conditions; minimal cost weighted tree; subgradient type algorithm; two-dimensional Weber problems
90C35: Programming involving graphs or networks
90B80: Discrete location and assignment
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
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