New metaheuristic approaches for the edge-weighted k-cardinality tree problem

This publication has 16 references indexed in Scilit:

• Metaheuristics in combinatorial optimization
  ACM Computing Surveys, 2003
• Local search algorithms for the k-cardinality tree problem
  Discrete Applied Mathematics, 2003
• Integer programming approaches tofacilities layout models with forbidden areas
  Annals of Operations Research, 1998
• Decomposing Matrices into Blocks
  SIAM Journal on Optimization, 1998
• AnO(logk)-approximation algorithm for thek minimum spanning tree problem in the plane
  Algorithmica, 1997
• Spanning Trees—Short or Small
  SIAM Journal on Discrete Mathematics, 1996
• Tabu Search – Using the Search Experience to Guide the Search Process. An Introduction with Examples
  AI Communications, 1995
• An introduction to simulated evolutionary optimization
  IEEE Transactions on Neural Networks, 1994
• Weighted k‐cardinality trees: Complexity and polyhedral structure
  Networks, 1994
• Future paths for integer programming and links to artificial intelligence
  Computers & Operations Research, 1986