Variable neighborhood search for the vertex weighted k-cardinality tree problem
Authors:
- J. BrimbergJBJ. Brimberg
- D. UroševićDUD. Urošević
- N. MladenovićNMN. Mladenović
- 16 May 2006
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 171 (1) , 74-84
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Variable neighborhood decomposition search for the edge weighted k-cardinality tree problemComputers & Operations Research, 2004
- Local search algorithms for the k-cardinality tree problemDiscrete Applied Mathematics, 2003
- Variable Neighborhood Decomposition SearchJournal of Heuristics, 2001
- Variable neighborhood search: Principles and applicationsEuropean Journal of Operational Research, 2001
- Variable neighborhood searchComputers & Operations Research, 1997
- OR software - ORSEP operations research software exchange program Edited by Professor H.W. Hamacher K_TREE/K_SUBGRAPH: A program package for minimal weighted K-cardinality trees and subgraphsEuropean Journal of Operational Research, 1996
- A short note on the approximability of the maximum leaves spanning tree problemInformation Processing Letters, 1994
- A new adaptive multi-start technique for combinatorial global optimizationsOperations Research Letters, 1994
- Weighted k‐cardinality trees: Complexity and polyhedral structureNetworks, 1994