Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: routing_lp_scheduling
Note: This documentation is automatically generated.
Classes to solve dimension cumul placement (aka scheduling) problems using linear programming.
Utility class used in the core optimizer to tighten the cumul bounds as much as possible based on the model precedences.
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2024-08-06 UTC.
[null,null,["Last updated 2024-08-06 UTC."],[],["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,[]]
