Google OR-Tools, algorithms under the hood?

Question

Under the hood, what algorithms does Google OR-tools support?

From adjacent questions, I saw someone as this question and the answer linked to this repo. However, these sources just show how to use Google OR-tools to solve problems, not explain something akin to "we support Ant Colony optimization for problems A, B and C."

I really have no idea if, on the backend, OR-tools is using established heuristic algorithms or if the developers introduced some/many novel algorithms that don't appear elsewhere in literature and/or popular solvers.

Answer 1

This was asked and replied multiple times

See:

https://stackoverflow.com/questions/54954890/what-approximate-tsp-algorithm-does-google-or-tools-use

and

https://stackoverflow.com/questions/57123397/which-solver-do-googles-or-tools-modules-for-csp-and-vrp-use/57125734#57125734

Also: https://github.com/or-tools/awesome_or-tools