Heuristics for the central tree problem

Authors:
Jørgen Bang-Jensen;Yury Nikulin
Affiliations:
Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark;Department of Mathematics, University of Turku, Turku, Finland
Venue:
Journal of Heuristics
Year:
2010

Citing 13
Cited 0

Computing edge-connectivity in multigraphs and capacitated graphs

SIAM Journal on Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On Central Spanning Trees of a Graph

Selected papers from the 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics and Computer Science
On central trees of a graph

Proceedings of the 17th Symposium of Research Institute of Electric Communication on Graph Theory and Algorithms
A Simple Min Cut Algorithm

ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Interval data minmax regret network optimization problems

Discrete Applied Mathematics
Simulated annealing algorithm for the robust spanning tree problem

Journal of Heuristics
Digraphs: Theory, Algorithms and Applications

Digraphs: Theory, Algorithms and Applications
An approximation algorithm for interval data minmax regret combinatorial optimization problems

Information Processing Letters
A constraint satisfaction approach to the robust spanning tree problem with interval data

UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
On the complexity of the robust spanning tree problem with interval data

Operations Research Letters
The robust spanning tree problem with interval data

Operations Research Letters
A branch and bound algorithm for the robust shortest path problem with interval data

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the central spanning tree problem (CTP). The problem consists in finding a spanning tree that minimizes the so-called robust deviation, i.e. deviation from a maximally distant tree. The distance between two trees is measured by means of the symmetric difference of their edge sets. The central tree problem is known to be NP-hard. We attack the problem with a hybrid heuristic consisting of: (1) a greedy construction heuristic to get a good initial solution and (2) fast local search improvement. We illustrate computationally efficiency of the proposed approach.