A branch and cut algorithm for the capacitated star-star telecommunication network problem.
Hüseyin GüdenErtan YakiciPublished in: Optim. Lett. (2019)
Keyphrases
- cost function
- learning algorithm
- preprocessing
- k means
- objective function
- telecommunication networks
- matching algorithm
- detection algorithm
- optimization algorithm
- linear programming
- worst case
- simulated annealing
- significant improvement
- segmentation algorithm
- computational complexity
- routing problem
- star shaped
- computational cost
- expectation maximization
- query processing
- lower bound
- benchmark problems
- search algorithm