Assessing the performance of bi-objective MST for Euclidean and non-Euclidean instances

DOI10.1007/978-3-642-14834-7_22MaRDI QIDQ3058845zbMATH OpenOpenAlexFDO

Authors Soma Saha, M. Aslam, Rajeev Kumar

Publication date 7 December 2010

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14834-7_22

zbMATH Keywords

heuristicscombinatorial optimizationmultiobjective optimizationPareto frontBDMST problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem
• Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
• An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
• Random-tree Diameter and the Diameter-constrained MST
• Evolutionary Multi-Criterion Optimization

Cited in

(1)

• An exact method for solving the bi-objective minimum diameter-cost spanning tree problem

This page was built for publication: Assessing the performance of bi-objective MST for Euclidean and non-Euclidean instances

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