[[["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."],[[["\u003cp\u003eThis C++ reference provides classes for solving vehicle routing problems with scheduling constraints, focusing on dimension cumulative placement using linear programming.\u003c/p\u003e\n"],["\u003cp\u003eIt includes core optimization tools for tightening cumulative bounds, along with specific classes for global and local dimension cumulative optimization.\u003c/p\u003e\n"],["\u003cp\u003eSeveral solver wrappers are available, such as CPSat, Glop, and generic linear solvers, for integrating with different optimization backends.\u003c/p\u003e\n"]]],["This C++ library provides classes for solving scheduling problems using linear programming, specifically focusing on dimension cumul placement. Key functionalities include tightening cumul bounds based on model precedences via `CumulBoundsPropagator`. The library also contains optimizers: `DimensionCumulOptimizerCore`, `GlobalDimensionCumulOptimizer`, `LocalDimensionCumulOptimizer`, and `ResourceAssignmentOptimizer`. Wrappers like `RoutingCPSatWrapper`, `RoutingGlopWrapper`, and `RoutingLinearSolverWrapper` facilitate integration with different solvers.\n"],null,[]]
