A bicriterion Steiner tree problem on graph

DOI10.2298/YJOR0301025VzbMath1065.90065OpenAlexW1987048529MaRDI QIDQ4827498

Milan Stanojević, Mirko Vujošević

Publication date: 18 November 2004

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/yjor0301025v

zbMATH Keywords

weighted graph

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (3)

Exact algorithms for bi-objective ring tree problems with reliability measures ⋮ Extensions of dynamic programming for multi-stage combinatorial optimization ⋮ Combinatorial optimization in system configuration design

This page was built for publication: A bicriterion Steiner tree problem on graph