On bicriterion minimal spanning trees: An approximation

DOI10.1016/S0305-0548(96)00026-3zbMath0876.90087OpenAlexW2046984978MaRDI QIDQ1360130

Kim Allan Andersen, Mikael Lind, Kurt O. Jørnsten

Publication date: 15 July 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(96)00026-3

zbMATH Keywords

heuristicsneighbourhood searchadjacent searchset of efficient spanning trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (16)

A new approach for the multiobjective minimum spanning tree ⋮ On the bicriterion - minimal cost/minimal label - spanning tree problem ⋮ An analysis on recombination in multi-objective evolutionary optimization ⋮ A label correcting approach for solving bicriterion shortest-path problems ⋮ On local optima in multiobjective combinatorial optimization problems ⋮ Ordered weighted average optimization in multiobjective spanning tree problem ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Exact algorithms for OWA-optimization in multiobjective spanning tree problems ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ Finding multi-objective supported efficient spanning trees ⋮ Empirical study of exact algorithms for the multi-objective spanning tree ⋮ A Survey on Multiple Objective Minimum Spanning Tree Problems ⋮ Connectedness of efficient solutions in multiple criteria combinatorial optimization ⋮ Clusters of Non-dominated Solutions in Multiobjective Combinatorial Optimization: An Experimental Analysis ⋮ A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices ⋮ The stochastic bottleneck linear programming problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• An interactive procedure using domination cones for bicriterion shortest path problems
• On spanning tree problems with multiple objectives
• Shortest chain subject to side constraints
• Self-adjusting binary search trees
• Bicriteria Transportation Problem
• Two Algorithms for Generating Weighted Spanning Trees in Order
• Minimal ratio spanning trees
• Needed: An Empirical Science of Algorithms
• Matroids and the greedy algorithm

This page was built for publication: On bicriterion minimal spanning trees: An approximation