Efficient algorithms for the prize collecting Steiner tree problems with interval data

DOI10.1007/978-3-642-14355-7_3MaRDI QIDQ3578355zbMATH OpenOpenAlexFDO

Authors Eduardo Álvarez-Miranda, Alfredo Candia, Xiaodong Hu, Bi Li, Xujin Chen

Publication date 20 July 2010

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14355-7_3

zbMATH Keywords

interval data2-treesprize collecting Steiner tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Risk models for the prize collecting Steiner tree problems with interval data
• Exact approaches for solving robust prize-collecting Steiner tree problems
• scientific article; zbMATH DE number 5629898
• Algorithmic expedients for the prize collecting Steiner tree problem
• Variations of the prize‐collecting Steiner tree problem

Cited in

(5)

• Risk models for the prize collecting Steiner tree problems with interval data
• Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree
• Robust optimization for routing problems on trees
• scientific article; zbMATH DE number 5629898 (Why is no real title available?)
• Exact approaches for solving robust prize-collecting Steiner tree problems

This page was built for publication: Efficient algorithms for the prize collecting Steiner tree problems with interval data

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