Branch-and-cut algorithms for the covering salesman problem.
Lucas Porto MazieroFábio Luiz UsbertiCelso CavellucciPublished in: RAIRO Oper. Res. (2023)
Keyphrases
- computationally efficient
- theoretical analysis
- computational cost
- database
- learning algorithm
- times faster
- computational efficiency
- e learning
- worst case
- highly efficient
- recently developed
- combinatorial optimization
- data mining algorithms
- benchmark datasets
- machine learning algorithms
- optimization problems
- significant improvement
- computational complexity
- data structure
- information systems
- computer vision
- artificial intelligence
- data mining
- neural network