An improved algorithm to solve the multi-criteria minimum spanning tree problem

MaRDI QIDQ5478223zbMATH OpenFDO

Authors Wenzhong Guo, Xuezhu Tu, Huowang Chen, Guolong Chen

Publication date 12 July 2006

zbMATH Keywords

minimum spanning treePareto optimal

Mathematics Subject Classification ID

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

Recommendations

• Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm
• A GRASP algorithm for the multi-criteria minimum spanning tree problem
• The multi-criteria minimum spanning tree problem based genetic algorithm
• A new approach for the multiobjective minimum spanning tree
• On spanning tree problems with multiple objectives

Cited in

(11)

• A new approach for the multiobjective minimum spanning tree
• Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm
• Kruskal with embedded c-semirings to solve MST problems with partially-ordered costs
• A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
• The multi-criteria minimum spanning tree problem based genetic algorithm
• On possibly optimal tradeoffs in multicriteria spanning tree problems
• A Survey on Multiple Objective Minimum Spanning Tree Problems
• Improved similarity measure in neutrosophic environment and its application in finding minimum spanning tree
• A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization
• Minimum spanning trees made easier via multi-objective optimization
• A GRASP algorithm for the multi-criteria minimum spanning tree problem

This page was built for publication: An improved algorithm to solve the multi-criteria minimum spanning tree problem

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