C++ Reference: disjunctive
Note: This documentation is automatically generated.
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."],[[["\u003cp\u003eThe C++ reference for 'disjunctive' provides classes for modeling and solving disjunctive scheduling problems, where tasks cannot overlap in time.\u003c/p\u003e\n"],["\u003cp\u003eThese classes offer various functionalities such as detecting precedences, managing task sets, and applying specific scheduling constraints for optimization.\u003c/p\u003e\n"],["\u003cp\u003eDevelopers can leverage these tools to efficiently handle scheduling scenarios within their C++ applications, facilitating optimized solutions for resource allocation and task sequencing.\u003c/p\u003e\n"]]],["The provided C++ documentation outlines classes related to disjunctive constraints within an optimization context. Key components include `AllIntervalsHelper`, `CombinedDisjunctive`, and `DisjunctivePrecedences`, indicating tools for managing and combining interval-based constraints. `DisjunctiveDetectablePrecedences`, `DisjunctiveEdgeFinding`, and `DisjunctiveNotLast` suggest methods for inferring and enforcing temporal relationships between tasks. `DisjunctiveOverloadChecker` verifies resource capacity, `DisjunctiveWithTwoItems` manages constraints on pairs, and `TaskSet` likely represents collections of tasks.\n"],null,["# disjunctive\n\nC++ Reference: disjunctive\n==========================\n\n\nNote: This documentation is automatically generated.\n\n| Classes ------- ||\n|--------------------------------------------------------------------------------------------------------------|---|\n| [AllIntervalsHelper](/optimization/reference/sat/disjunctive/AllIntervalsHelper) |\n| [CombinedDisjunctive](/optimization/reference/sat/disjunctive/CombinedDisjunctive) |\n| [DisjunctiveDetectablePrecedences](/optimization/reference/sat/disjunctive/DisjunctiveDetectablePrecedences) |\n| [DisjunctiveEdgeFinding](/optimization/reference/sat/disjunctive/DisjunctiveEdgeFinding) |\n| [DisjunctiveNotLast](/optimization/reference/sat/disjunctive/DisjunctiveNotLast) |\n| [DisjunctiveOverloadChecker](/optimization/reference/sat/disjunctive/DisjunctiveOverloadChecker) |\n| [DisjunctivePrecedences](/optimization/reference/sat/disjunctive/DisjunctivePrecedences) |\n| [DisjunctiveWithTwoItems](/optimization/reference/sat/disjunctive/DisjunctiveWithTwoItems) |\n| [TaskSet](/optimization/reference/sat/disjunctive/TaskSet) |"]]