KCTLIB -- Best known solutions
Up: index
Previous: index
-
- 1
-
M.J. Blesa and F. Xhafa.
A C++ Implementation of Tabu Search for
-Cardinality
Tree Problem based on Generic Programming and Component Reuse.
In Net.ObjectDays 2000 Tagungsband, pages 648-652, Erfurt,
Germany, 2000. Net.ObjectDays-Forum.
- 2
-
C. Blum and M. Blesa.
New metaheuristics approaches for the edge-weighted
-cardinality tree problem. Computers & Operations Research, 2004. In press.
Also available as Technical Report LSI-03-1-R, Departament de Llenguatges i Sistemes
Informàtics, Universitat Politècnica de Catalunya, Barcelona, Spain,
2003.
- 3
-
K. Jørnsten and A. Løkketangen.
Tabu search for weighted
-cardinality trees.
Asia-Pacific Journal of Operational Research, 14(2):9-26,
1997.
- 3
-
C. Blum.
A new hybrid evolutionary algorithm for the
-cardinality trees problem.
Technical report LSI-06-3-R of LSI, Universitat Politecnica de Catalunya, Barcelona, Spain, 2006.
[ Home | Introduction | Problem instances | Software | Best known solutions]