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

DOI10.1007/BF01416225MaRDI QIDQ5753761zbMATH OpenOpenAlexFDO

Authors F. Donno, Giancarlo Pesamosca

Publication date 1990

Published in 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

minimal cost weighted treenecessary and sufficient optimality conditionsSteiner problemsubgradient type algorithmtwo-dimensional Weber problems

Mathematics Subject Classification ID

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

Recommendations

• Generalized Steiner problems and other variants
• Problems with generalized Steiner problems
• A primal-dual approximation algorithm for generalized Steiner network problems
• Convex relaxation and variational approximation of the Steiner problem: theory and numerics
• The general Steiner problem in Boolean space and application
• Some generalizations of the steiner problem in graphs
• A convex approach to the Gilbert-Steiner problem
• Subclass of the Steiner problems on a plane with rectilinear metric
• scientific article; zbMATH DE number 1182759
• Generalized Steiner problem in outerplanar networks

Cites work

• Augmenting Euclidean Networks—the Steiner Case
• Convex Analysis
• scientific article; zbMATH DE number 3972625 (Why is no real title available?)
• scientific article; zbMATH DE number 3894826 (Why is no real title available?)
• Location Theory, Dominance, and Convexity
• Steiner Minimal Trees
• Technical Note—Location Theory: A Selective Bibliography

Cited in

(8)

• 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
• Convex relaxation and variational approximation of the Steiner problem: theory and numerics
• A direct solution of allocation problems
• scientific article; zbMATH DE number 3916324 (Why is no real title available?)
• Convexity and the Steiner tree problem
• scientific article; zbMATH DE number 4055340 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5753761)