Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <bop_base.h>
Public Member Functions | |
LearnedInfo (const sat::LinearBooleanProblem &problem) | |
void | Clear () |
Public Attributes | |
std::vector< sat::Literal > | fixed_literals |
Vector of all literals that have been fixed. | |
BopSolution | solution |
New solution. Note that the solution might be infeasible. | |
int64_t | lower_bound |
A lower bound (for multi-threading purpose). | |
glop::DenseRow | lp_values |
std::vector< sat::BinaryClause > | binary_clauses |
New binary clauses. | |
This struct represents what has been learned on the problem state by running an optimizer. The goal is then to merge the learned information with the problem state in order to get a more constrained problem to be used by the next called optimizer.
Definition at line 255 of file bop_base.h.
|
inlineexplicit |
Definition at line 256 of file bop_base.h.
|
inline |
Clears all just as if the object were a brand new one. This can be used to reduce the number of creation / deletion of objects.
Definition at line 265 of file bop_base.h.
std::vector<sat::BinaryClause> operations_research::bop::LearnedInfo::binary_clauses |
New binary clauses.
Definition at line 288 of file bop_base.h.
std::vector<sat::Literal> operations_research::bop::LearnedInfo::fixed_literals |
Vector of all literals that have been fixed.
Definition at line 273 of file bop_base.h.
int64_t operations_research::bop::LearnedInfo::lower_bound |
A lower bound (for multi-threading purpose).
Definition at line 279 of file bop_base.h.
glop::DenseRow operations_research::bop::LearnedInfo::lp_values |
An assignment for the relaxed linear programming problem (can be empty). This is meant to be the optimal LP solution, but can just be a feasible solution or any floating point assignment if the LP solver didn't solve the relaxed problem optimally.
Definition at line 285 of file bop_base.h.
BopSolution operations_research::bop::LearnedInfo::solution |
New solution. Note that the solution might be infeasible.
Definition at line 276 of file bop_base.h.