用于CSP和VRP的Google OR-Tools模块使用哪个求解器？

Question

I am currently evaluating googles or-tools and just noticed that it's not really a solver on its own but mainly an interface to other solvers. What I'd like to know is which solvers this framework uses for constraint and routing problems.

I have already looked thoroughly through https://developers.google.com/optimization/, but only found that

• for linear optimization Google's "in-house, open-source GLOP" is used
• for network flow optimization an own solver seems to be used ("OR-Tools provides several solvers for network flow problems in its graph libraries.")
• for mixed integer programming the open-source programm "COIN OR branch&cut" is used by default (but SCIP, GLPK and Gurobi can be integrated)

But on the CP & VRP info/guide sites there is no indication as to what solver is used for these problems...

Does anyone happen to know which solver is used for CSP / VRP or have you found something I overread?

Answer 1

这在邮件列表/ github问题上得到了多次回答：

• 路由库使用CP求解器，其顶部是“本地搜索”实施。看到这个Github问题

• CP-SAT解算器在SAT解算器之上使用了惰性子句生成解算器。最好的描述是Peter Stuckey的演讲，名为Search is Dead