Disjunctive combinatorial branch in a subgradient tree algorithm for the DCMST problem with VNS-Lagrangian bounds.
Rafael Castro de AndradeAdriano Tavares de FreitasPublished in: Electron. Notes Discret. Math. (2013)
Keyphrases
- worst case
- optimal solution
- dynamic programming
- np hard
- confidence bounds
- tree structure
- binary tree
- k means
- search space
- lower bound
- learning algorithm
- detection algorithm
- combinatorial optimization
- computational complexity
- simulated annealing
- objective function
- graph structure
- linear programming
- lower and upper bounds
- minimum spanning tree
- relaxation algorithm
- spanning tree
- error bounds
- tabu search
- scheduling problem
- decision trees