Dynamic programming for spanning tree problems: application to the multi-objective case

DOI10.1007/s11590-014-0759-1zbMath1317.90312OpenAlexW2039172800WikidataQ58921037 ScholiaQ58921037MaRDI QIDQ2018859

Luigi Di Puglia Pugliese, José Luis Santos, Francesca Guerriero

Publication date: 25 March 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10316/44347

zbMATH Keywords

dynamic programmingmultiple objective programmingPareto frontspanning tree problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Dynamic programming (90C39)

Related Items

A multi-agent transgenetic algorithm for the bi-objective spanning tree problem, A new approach for the multiobjective minimum spanning tree, Two‐phase strategies for the bi‐objective minimum spanning tree problem, On solving bi-objective constrained minimum spanning tree problems, Finding multi-objective supported efficient spanning trees, Empirical study of exact algorithms for the multi-objective spanning tree, On type-2 fuzzy weighted minimum spanning tree

Cites Work

• On spanning tree problems with multiple objectives
• A flexible algorithm for generating all the spanning trees in undirected graphs
• The problem of the optimal biobjective spanning tree
• Genetic algorithm approach on multi-criteria minimum spanning tree problem
• Shortest paths algorithms: Theory and experimental evaluation
• Computing all efficient solutions of the biobjective minimum spanning tree problem
• On the bicriterion - minimal cost/minimal label - spanning tree problem
• An algorithm for the steiner problem in graphs
• Minimum-weight spanning tree algorithms. A survey and empirical study