On bicriterion minimal spanning trees: An approximation

DOI10.1016/S0305-0548(96)00026-3MaRDI QIDQ1360130zbMATH OpenOpenAlexFDO

Authors Kim Allan Andersen, Mikael Lind, Kurt 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)

Recommendations

• On spanning tree problems with multiple objectives
• The problem of the optimal biobjective spanning tree
• scientific article; zbMATH DE number 3891405
• On the bicriterion - minimal cost/minimal label - spanning tree problem

Cites work

• scientific article; zbMATH DE number 4070651 (Why is no real title available?)
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 3675956 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1086965 (Why is no real title available?)
• An interactive procedure using domination cones for bicriterion shortest path problems
• Bicriteria Transportation Problem
• Matroids and the greedy algorithm
• Minimal ratio spanning trees
• Needed: An Empirical Science of Algorithms
• Network flows. Theory, algorithms, and applications.
• On spanning tree problems with multiple objectives
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Self-adjusting binary search trees
• Shortest chain subject to side constraints
• Two Algorithms for Generating Weighted Spanning Trees in Order

Cited in

(18)

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

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

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