always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

improve robustness of GLOP; continue rewriting of CP-SAT search internals; fix table extraction

Browse Source
This commit is contained in:
Laurent Perron
2019-04-18 16:34:36 +02:00
parent 5b5116df81
commit 0d8a6aeb39
6 changed files with 74 additions and 89 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
ortools/sat/optimization.h
View File

@@ -143,8 +143,12 @@ void RestrictObjectiveDomainWithBinarySearch(
// Same as MinimizeIntegerVariableWithLinearScanAndLazyEncoding() but use
// a core-based approach instead. Note that the given objective_var is just used
// for reporting the lower-bound and do not need to be linked with its linear
// representation.
// for reporting the lower-bound/upper-bound and do not need to be linked with
// its linear representation.
//
// Unlike MinimizeIntegerVariableWithLinearScanAndLazyEncoding() this function
// just return the last solver status. In particular if it is INFEASIBLE but
// feasible_solution_observer() was called, it means we are at OPTIMAL.
SatSolver::Status MinimizeWithCoreAndLazyEncoding(
IntegerVariable objective_var,
const std::vector<IntegerVariable>& variables,