A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs.
Uwe H. SuhlHeinrich HilbertPublished in: Networks (1998)
Keyphrases
- benchmark problems
- search space
- cost function
- convex quadratic programming
- dynamic programming
- combinatorial optimization
- quadratic optimization problems
- learning algorithm
- iterative algorithms
- minimum spanning tree
- optimal solution
- solving problems
- partial solutions
- probabilistic model
- np hard
- detection algorithm
- graph partitioning
- optimization problems
- linear programming problems
- adjacency graph
- polynomial time complexity