An adaptive heuristic to the bounded-diameter minimum spanning tree problem.
Javad Akbari TorkestaniPublished in: Soft Comput. (2012)
Keyphrases
- heuristic methods
- search strategies
- heuristic solution
- dynamic programming
- minimum spanning tree
- databases
- bin packing
- search algorithm
- combinatorial optimization
- solution quality
- search effort
- real time
- job shop scheduling problem
- heuristic search
- np complete
- simulated annealing
- learning environment
- website
- machine learning