A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs.
Alexandre Salles da CunhaAbilio LucenaNelson MaculanMauricio G. C. ResendePublished in: Discret. Appl. Math. (2009)
Keyphrases
- prize collecting
- cost function
- learning algorithm
- optimal solution
- computational complexity
- optimization algorithm
- simulated annealing
- dynamic programming
- np hard
- search space
- worst case
- graph structure
- adjacency graph
- combinatorial optimization
- convergence rate
- benchmark problems
- graph isomorphism
- objective function