Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm

DOI10.1016/S0377-2217(01)00346-0zbMath1082.90560MaRDI QIDQ1848402

David W. Corne, Joshua D. Knowles

Publication date: 20 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Genetic algorithmsGraph theoryCombinatorial optimizationMinimum spanning treeMultiple-criteria optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

C-semiring Frameworks for Minimum Spanning Tree Problems ⋮ Two‐phase strategies for the bi‐objective minimum spanning tree problem ⋮ Empirical study of exact algorithms for the multi-objective spanning tree ⋮ Optimality conditions in preference-based spanning tree problems ⋮ Combinatorial optimization in system configuration design

Cites Work

• Genetic algorithm approach on multi-criteria minimum spanning tree problem

This page was built for publication: Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm