Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: sat
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.
[[["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 document serves as a C++ reference for the \u003ccode\u003esat\u003c/code\u003e library, which is automatically generated.\u003c/p\u003e\n"],["\u003cp\u003eThe \u003ccode\u003esat\u003c/code\u003e library contains a wide range of modules, including those related to constraint programming, model checking, solving, and more.\u003c/p\u003e\n"],["\u003cp\u003eThe available modules cover functionalities such as handling different constraints, managing models, and various optimization techniques within the \u003ccode\u003esat\u003c/code\u003e domain.\u003c/p\u003e\n"],["\u003cp\u003eThe documentation contains libraries like \u003ccode\u003ecp_model\u003c/code\u003e for Constraint Programming, \u003ccode\u003elinear_constraint\u003c/code\u003e for linear relationships, and \u003ccode\u003esat_solver\u003c/code\u003e for Boolean Satisfiability solving.\u003c/p\u003e\n"]]],["This document details the C++ reference for the \"sat\" library, an optimization tool. It catalogs various library components, including modules for constraint programming (`cp_constraints`, `cp_model`), linear programming (`linear_constraint`, `linear_relaxation`), and Boolean satisfiability (`boolean_problem`, `clause`). Key actions involve defining, solving, and optimizing problems using these modules. Additional components manage model expansion, checking, presolving, postsolving, searching, symmetries, and handling proofs, and various utilities.\n"],null,["# sat\n\nC++ Reference: sat\n==================\n\n\nNote: This documentation is automatically generated.\n\n| Libraries --------- ||\n|--------------------------------------------------------------------------------------------|---|\n| [all_different](/optimization/reference/sat/all_different) |\n| [boolean_problem](/optimization/reference/sat/boolean_problem) |\n| [circuit](/optimization/reference/sat/circuit) |\n| [clause](/optimization/reference/sat/clause) |\n| [cp_constraints](/optimization/reference/sat/cp_constraints) |\n| [cp_model](/optimization/reference/sat/cp_model) |\n| [cp_model_checker](/optimization/reference/sat/cp_model_checker) |\n| [cp_model_expand](/optimization/reference/sat/cp_model_expand) |\n| [cp_model_lns](/optimization/reference/sat/cp_model_lns) |\n| [cp_model_loader](/optimization/reference/sat/cp_model_loader) |\n| [cp_model_mapping](/optimization/reference/sat/cp_model_mapping) |\n| [cp_model_objective](/optimization/reference/sat/cp_model_objective) |\n| [cp_model_postsolve](/optimization/reference/sat/cp_model_postsolve) |\n| [cp_model_presolve](/optimization/reference/sat/cp_model_presolve) |\n| [cp_model_search](/optimization/reference/sat/cp_model_search) |\n| [cp_model_solver](/optimization/reference/sat/cp_model_solver) |\n| [cp_model_symmetries](/optimization/reference/sat/cp_model_symmetries) |\n| [cp_model_utils](/optimization/reference/sat/cp_model_utils) |\n| [cumulative](/optimization/reference/sat/cumulative) |\n| [cumulative_energy](/optimization/reference/sat/cumulative_energy) |\n| [cuts](/optimization/reference/sat/cuts) |\n| [diffn](/optimization/reference/sat/diffn) |\n| [diffn_util](/optimization/reference/sat/diffn_util) |\n| [disjunctive](/optimization/reference/sat/disjunctive) |\n| [drat_checker](/optimization/reference/sat/drat_checker) |\n| [drat_proof_handler](/optimization/reference/sat/drat_proof_handler) |\n| [drat_writer](/optimization/reference/sat/drat_writer) |\n| [encoding](/optimization/reference/sat/encoding) |\n| [feasibility_pump](/optimization/reference/sat/feasibility_pump) |\n| [implied_bounds](/optimization/reference/sat/implied_bounds) |\n| [inclusion](/optimization/reference/sat/inclusion) |\n| [integer](/optimization/reference/sat/integer) |\n| [integer_expr](/optimization/reference/sat/integer_expr) |\n| [integer_search](/optimization/reference/sat/integer_search) |\n| [intervals](/optimization/reference/sat/intervals) |\n| [lb_tree_search](/optimization/reference/sat/lb_tree_search) |\n| [linear_constraint](/optimization/reference/sat/linear_constraint) |\n| [linear_constraint_manager](/optimization/reference/sat/linear_constraint_manager) |\n| [linear_programming_constraint](/optimization/reference/sat/linear_programming_constraint) |\n| [linear_relaxation](/optimization/reference/sat/linear_relaxation) |\n| [lp_utils](/optimization/reference/sat/lp_utils) |\n| [max_hs](/optimization/reference/sat/max_hs) |\n| [model](/optimization/reference/sat/model) |\n| [optimization](/optimization/reference/sat/optimization) |\n| [parameters_validation](/optimization/reference/sat/parameters_validation) |\n| [pb_constraint](/optimization/reference/sat/pb_constraint) |\n| [precedences](/optimization/reference/sat/precedences) |\n| [presolve_context](/optimization/reference/sat/presolve_context) |\n| [presolve_util](/optimization/reference/sat/presolve_util) |\n| [probing](/optimization/reference/sat/probing) |\n| [pseudo_costs](/optimization/reference/sat/pseudo_costs) |\n| [restart](/optimization/reference/sat/restart) |\n| [rins](/optimization/reference/sat/rins) |\n| [sat_base](/optimization/reference/sat/sat_base) |\n| [sat_decision](/optimization/reference/sat/sat_decision) |\n| [sat_inprocessing](/optimization/reference/sat/sat_inprocessing) |\n| [sat_solver](/optimization/reference/sat/sat_solver) |\n| [scheduling_constraints](/optimization/reference/sat/scheduling_constraints) |\n| [scheduling_cuts](/optimization/reference/sat/scheduling_cuts) |\n| [simplification](/optimization/reference/sat/simplification) |\n| [subsolver](/optimization/reference/sat/subsolver) |\n| [swig_helper](/optimization/reference/sat/swig_helper) |\n| [symmetry](/optimization/reference/sat/symmetry) |\n| [symmetry_util](/optimization/reference/sat/symmetry_util) |\n| [synchronization](/optimization/reference/sat/synchronization) |\n| [table](/optimization/reference/sat/table) |\n| [theta_tree](/optimization/reference/sat/theta_tree) |\n| [timetable](/optimization/reference/sat/timetable) |\n| [timetable_edgefinding](/optimization/reference/sat/timetable_edgefinding) |\n| [util](/optimization/reference/sat/util) |\n| [var_domination](/optimization/reference/sat/var_domination) |\n| [zero_half_cuts](/optimization/reference/sat/zero_half_cuts) |"]]
