A divide and conquer matheuristic algorithm for the Prize-collecting Steiner Tree Problem.
Murodzhon AkhmedovIvo KweeRoberto MontemanniPublished in: Comput. Oper. Res. (2016)
Keyphrases
- prize collecting
- dynamic programming
- detection algorithm
- similarity measure
- cost function
- np hard
- optimization algorithm
- optimal solution
- preprocessing
- computational complexity
- particle swarm optimization
- expectation maximization
- segmentation algorithm
- mathematical model
- computational efficiency
- convergence rate
- search strategy
- single machine scheduling problem
- multicast routing
- genetic algorithm