![]() |
OR-Tools
8.2
|
Go to the source code of this file.
Namespaces | |
operations_research | |
The vehicle routing library lets one model and solve generic vehicle routing problems ranging from the Traveling Salesman Problem to more complex problems such as the Capacitated Vehicle Routing Problem with Time Windows. | |
Functions | |
const KnapsackSearchNodeForCuts * | MoveUpToDepth (const KnapsackSearchNodeForCuts *node, int depth) |
const double profit_max |
Definition at line 38 of file knapsack_solver_for_cuts.cc.