Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <zero_half_cuts.h>
Public Attributes | |
std::vector< std::pair< glop::RowIndex, IntegerValue > > | multipliers |
How this row was formed from the initial problem constraints. | |
std::vector< int > | cols |
The index of the odd coefficient of this combination. | |
int | rhs_parity |
The parity of the rhs (1 for odd). | |
double | slack |
How tight this constraints is under the current LP solution. | |
Visible for testing.
Boolean matrix. Each column correspond to one variable (col indices). Each row to a sum of the initial problem constraints. We store the coefficient modulo 2, so only the positions of the ones.
Definition at line 66 of file zero_half_cuts.h.
std::vector<int> operations_research::sat::ZeroHalfCutHelper::CombinationOfRows::cols |
The index of the odd coefficient of this combination.
Definition at line 71 of file zero_half_cuts.h.
std::vector<std::pair<glop::RowIndex, IntegerValue> > operations_research::sat::ZeroHalfCutHelper::CombinationOfRows::multipliers |
How this row was formed from the initial problem constraints.
Definition at line 68 of file zero_half_cuts.h.
int operations_research::sat::ZeroHalfCutHelper::CombinationOfRows::rhs_parity |
The parity of the rhs (1 for odd).
Definition at line 74 of file zero_half_cuts.h.
double operations_research::sat::ZeroHalfCutHelper::CombinationOfRows::slack |
How tight this constraints is under the current LP solution.
Definition at line 77 of file zero_half_cuts.h.