![]() |
Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
|
#include <set_cover_cft.h>
Public Member Functions | |
BoundCBs (const SubModel &model) | |
Cost | step_size () const |
bool | ExitCondition (const SubgradientContext &context) override |
void | ComputeMultipliersDelta (const SubgradientContext &context, ElementCostVector &delta_mults) override |
void | RunHeuristic (const SubgradientContext &context, Solution &solution) override |
bool | UpdateCoreModel (SubgradientContext context, CoreModel &core_model, bool force=false) override |
Public Member Functions inherited from operations_research::scp::SubgradientCBs | |
virtual | ~SubgradientCBs ()=default |
Static Public Attributes | |
static constexpr Cost | kTol = 1e-6 |
Subgradient callbacks implementation focused on improving the current best dual bound.
Definition at line 226 of file set_cover_cft.h.
operations_research::scp::BoundCBs::BoundCBs | ( | const SubModel & | model | ) |
SUBGRADIENT /////////////////////////////
Definition at line 144 of file set_cover_cft.cc.
|
overridevirtual |
Implements operations_research::scp::SubgradientCBs.
Definition at line 188 of file set_cover_cft.cc.
|
overridevirtual |
(Not in [1]): During the first unfixed iteration we want to converge closer to the optimum
Implements operations_research::scp::SubgradientCBs.
Definition at line 160 of file set_cover_cft.cc.
|
inlineoverridevirtual |
Implements operations_research::scp::SubgradientCBs.
Definition at line 235 of file set_cover_cft.h.
|
inline |
Definition at line 231 of file set_cover_cft.h.
|
overridevirtual |
Grant at least min_iters iterations before the next exit test
Implements operations_research::scp::SubgradientCBs.
Definition at line 270 of file set_cover_cft.cc.
|
staticconstexpr |
Definition at line 228 of file set_cover_cft.h.