If feasible, computes the optimal cost of the entire model with regards to
the optimizer_core_'s dimension costs, minimizing cumul soft lower/upper
bound costs and vehicle/global span costs, and stores it in "optimal_cost"
(if not null).
Returns true iff all the constraints can be respected.
If feasible, computes the optimal values for cumul, break and resource
variables, minimizing cumul soft lower/upper bound costs and vehicle/global
span costs, stores them in "optimal_cumuls" (if not null), "optimal_breaks"
and "optimal_resource_indices_per_group", and returns true.
Returns false if the routes are not feasible.
Similar to ComputeCumuls, but also tries to pack the cumul values on all
routes, such that the cost remains the same, the cumuls of route ends are
minimized, and then the cumuls of the starts of the routes are maximized.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[],["The `GlobalDimensionCumulOptimizer` class computes optimal values for cumul, break, and resource variables. It has methods to compute the optimal cost without transits (`ComputeCumulCostWithoutFixedTransits`), optimal values for cumul and breaks (`ComputeCumuls`), and packed cumul values across routes (`ComputePackedCumuls`). These computations minimize cumul soft lower/upper bound costs and vehicle/global span costs. It takes a `RoutingDimension` and a solver type to function, providing the `dimension` itself as well.\n"]]