C++ Reference: encoding
Note: This documentation is automatically generated.
Algorithms to encode constraints into their SAT representation. Currently, this contains one possible encoding of a cardinality constraint as used by the core-based optimization algorithm in optimization.h.
This is also known as the incremental totalizer encoding in the literature.
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 documentation outlines algorithms in C++ used for encoding constraints into a SAT representation for optimization."],["It features an incremental totalizer encoding for cardinality constraints, specifically utilized by the core-based optimization algorithm."],["The provided resource offers a class named `EncodingNode` for further exploration and implementation."]]],["The document describes algorithms for encoding constraints into SAT representations, specifically focusing on cardinality constraints. It details an encoding method employed by the core-based optimization algorithm, referred to as the incremental totalizer encoding. The documentation also provides information on the `EncodingNode` class, which is part of this encoding process. This content is derived from the C++ Reference related to encoding in the context of SAT solvers.\n"]]
