Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem

@article{Urosevic2004VariableND,
  title={Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem},
  author={Dragan Urosevic and Jack Brimberg and Nenad Mladenovic},
  journal={Computers & OR},
  year={2004},
  volume={31},
  pages={1205-1213}
}
The minimum k-cardinality tree problem on graph G consists in 2nding a subtree of G with exactly k edges whose sum of weights is minimum. A number of heuristic methods have been developed recently to solve this NP-hard problem. In this paper a decomposition approach is developed and implemented within a successive approximation scheme known as variable neighborhood decomposition search. This approach obtains superior results over existing methods, and furthermore, allows larger problem… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Tabu search for weighted k-cardinality trees

  • K JJ ornsten, A. Lokketangen
  • Asia-Paci2c Journal of Operational Research
  • 1997
Highly Influential
6 Excerpts

Developments of variable neighborhood search

  • P Hansen, N. Mladenovi c
  • Essays and surveys in metaheuristics
  • 2001

Mladenovi* c N. Variable neighborhood search: principles and applications

  • P Hansen
  • European Journal of Operational Research
  • 2001

An introduction to variable neighborhood search. In: Voss S, editor. Meta-heuristics, advances and trends in local search paradigms for optimization

  • P Hansen, N. Mladenovi c
  • Dordrecht: Kluwer Academic Publishers,
  • 1999

Similar Papers

Loading similar papers…