Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem.
C. PatvardhanV. Prem PrakashAnand SrivastavPublished in: Informatica (Slovenia) (2015)
Keyphrases
- integer linear programming formulation
- timetabling problem
- search procedures
- randomly generated
- quadratic assignment problem
- set of randomly generated instances
- search algorithm
- euclidean space
- random instances
- euclidean distance
- propositional satisfiability
- backtrack search
- exact algorithms
- memetic algorithm
- stochastic local search
- admissible heuristics
- exact methods
- maximum distance
- finding optimal solutions
- constraint satisfaction problems