Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::bop::LearnedInfo Struct Reference

#include <bop_base.h>

Public Member Functions

 LearnedInfo (const sat::LinearBooleanProblem &problem)
 
void Clear ()
 

Public Attributes

std::vector< sat::Literalfixed_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::BinaryClausebinary_clauses
 New binary clauses.
 

Detailed Description

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.

Constructor & Destructor Documentation

◆ LearnedInfo()

operations_research::bop::LearnedInfo::LearnedInfo ( const sat::LinearBooleanProblem & problem)
inlineexplicit

Definition at line 256 of file bop_base.h.

Member Function Documentation

◆ Clear()

void operations_research::bop::LearnedInfo::Clear ( )
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.

Member Data Documentation

◆ binary_clauses

std::vector<sat::BinaryClause> operations_research::bop::LearnedInfo::binary_clauses

New binary clauses.

Definition at line 288 of file bop_base.h.

◆ fixed_literals

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.

◆ lower_bound

int64_t operations_research::bop::LearnedInfo::lower_bound

A lower bound (for multi-threading purpose).

Definition at line 279 of file bop_base.h.

◆ lp_values

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.

◆ solution

BopSolution operations_research::bop::LearnedInfo::solution

New solution. Note that the solution might be infeasible.

Definition at line 276 of file bop_base.h.


The documentation for this struct was generated from the following file: