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

DOI10.1007/S11590-014-0759-1MaRDI QIDQ2018859zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Recommendations

• On spanning tree problems with multiple objectives
• Combining linear and nonlinear objectives in spanning tree problems
• A Survey on Multiple Objective Minimum Spanning Tree Problems
• Publication:4733693
• The problem of the optimal biobjective spanning tree

Cites work

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

Cited in

(9)

• A new approach for the multiobjective minimum spanning tree
• Finding multi-objective supported efficient spanning trees
• On type-2 fuzzy weighted minimum spanning tree
• A multi-agent transgenetic algorithm for the bi-objective spanning tree problem
• Empirical study of exact algorithms for the multi-objective spanning tree
• DynASP2.5: Dynamic Programming on Tree Decompositions in Action
• Two‐phase strategies for the bi‐objective minimum spanning tree problem
• On solving bi-objective constrained minimum spanning tree problems
• New dynamic programming algorithm for the multiobjective minimum spanning tree problem

This page was built for publication: Dynamic programming for spanning tree problems: application to the multi-objective case

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