Branch-and-cut algorithms for the covering salesman problem.
Lucas Porto MazieroFabio Luiz UsbertiCelso CavellucciPublished in: CoRR (2021)
Keyphrases
- recently developed
- significant improvement
- orders of magnitude
- computational cost
- optimization problems
- learning algorithm
- decision trees
- efficient implementation
- machine learning algorithms
- computationally intensive
- database
- combinatorial optimization
- computationally efficient
- multi objective
- multi agent
- case study
- social networks
- neural network