Login / Signup

Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem.

Martin GruberGünther R. Raidl
Published in: SAINT (2008)
Keyphrases
  • special case
  • dynamic programming
  • neural network
  • genetic algorithm
  • simulated annealing
  • tabu search
  • linear program
  • lower and upper bounds
  • beam search
  • dantzig wolfe