A branch-and-cut algorithm for the Steiner tree problem with delays.
Valeria LeggieriMohamed HaouariChefi TrikiPublished in: Optim. Lett. (2012)
Keyphrases
- computational cost
- improved algorithm
- detection algorithm
- experimental evaluation
- high accuracy
- preprocessing
- k means
- cost function
- dynamic programming
- single pass
- expectation maximization
- np hard
- input data
- optimization algorithm
- path planning
- segmentation method
- matching algorithm
- theoretical analysis
- selection algorithm
- estimation algorithm
- recognition algorithm
- convergence rate
- neural network
- multicast routing
- memory requirements
- experimental study
- segmentation algorithm
- linear programming
- optimal solution
- objective function
- similarity measure
- learning algorithm