Generated on for Gecode by doxygen 1.18.0
Gecode::Search::Incumbent Class Reference

Best solution found so far. More...

#include <gecode/search/heuristic.hh>

Public Member Functions

 Incumbent (HeuristicGuidance::Sense s)
 Initialize without incumbent.
bool improves (std::int64_t b) const
 Whether a node with bound b can improve the incumbent.
void update (Space *s, std::int64_t b)
 Make s with objective value b the incumbent.
void reset (void)
 Remove incumbent.

Public Attributes

HeuristicGuidance::Sense sense
 Objective direction.
std::unique_ptr< Space > space
 The solution (if any).
std::int64_t bound
 Its objective value.
unsigned long long int revision
 Incremented for every new incumbent.

Detailed Description

Best solution found so far.

Definition at line 87 of file heuristic.hh.

Constructor & Destructor Documentation

◆ Incumbent()

Gecode::Search::Incumbent::Incumbent ( HeuristicGuidance::Sense s)
inline

Initialize without incumbent.

Definition at line 98 of file heuristic.hh.

Member Function Documentation

◆ improves()

bool Gecode::Search::Incumbent::improves ( std::int64_t b) const
inline

Whether a node with bound b can improve the incumbent.

Definition at line 101 of file heuristic.hh.

◆ update()

void Gecode::Search::Incumbent::update ( Space * s,
std::int64_t b )
inline

Make s with objective value b the incumbent.

Definition at line 105 of file heuristic.hh.

◆ reset()

void Gecode::Search::Incumbent::reset ( void )
inline

Remove incumbent.

Definition at line 109 of file heuristic.hh.

Member Data Documentation

◆ sense

HeuristicGuidance::Sense Gecode::Search::Incumbent::sense

Objective direction.

Definition at line 90 of file heuristic.hh.

◆ space

std::unique_ptr<Space> Gecode::Search::Incumbent::space

The solution (if any).

Definition at line 92 of file heuristic.hh.

◆ bound

std::int64_t Gecode::Search::Incumbent::bound

Its objective value.

Definition at line 94 of file heuristic.hh.

◆ revision

unsigned long long int Gecode::Search::Incumbent::revision

Incremented for every new incumbent.

Definition at line 96 of file heuristic.hh.


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