SCIP

Solving Constraint Integer Programs

Public Member Functions
tsp::HeurFarthestInsert Class Reference

Detailed Description

C++ farthest insert heuristic for TSP

Definition at line 32 of file HeurFarthestInsert.h.

#include <HeurFarthestInsert.h>

Collaboration diagram for tsp::HeurFarthestInsert:
Collaboration graph
[legend]

Public Member Functions

 HeurFarthestInsert (SCIP *scip)
 
virtual ~HeurFarthestInsert ()
 
virtual SCIP_DECL_HEURFREE (scip_free)
 
virtual SCIP_DECL_HEURINIT (scip_init)
 
virtual SCIP_DECL_HEUREXIT (scip_exit)
 
virtual SCIP_DECL_HEURINITSOL (scip_initsol)
 
virtual SCIP_DECL_HEUREXITSOL (scip_exitsol)
 
virtual SCIP_DECL_HEUREXEC (scip_exec)
 
virtual SCIP_DECL_HEURCLONE (ObjCloneable *clone)
 
virtual SCIP_DECL_HEURISCLONEABLE (iscloneable)
 

Constructor & Destructor Documentation

tsp::HeurFarthestInsert::HeurFarthestInsert ( SCIP *  scip)
inline

default constructor

Definition at line 38 of file HeurFarthestInsert.h.

virtual tsp::HeurFarthestInsert::~HeurFarthestInsert ( )
inlinevirtual

destructor

Definition at line 48 of file HeurFarthestInsert.h.

References release_graph(), SCIP_DECL_HEURCLONE(), SCIP_DECL_HEUREXEC(), SCIP_DECL_HEUREXIT(), SCIP_DECL_HEUREXITSOL(), SCIP_DECL_HEURFREE(), SCIP_DECL_HEURINIT(), and SCIP_DECL_HEURINITSOL().

Member Function Documentation

virtual tsp::HeurFarthestInsert::SCIP_DECL_HEURCLONE ( ObjCloneable *  clone)
virtual

clone method which will be used to copy a objective plugin

Referenced by ~HeurFarthestInsert().

virtual tsp::HeurFarthestInsert::SCIP_DECL_HEUREXEC ( scip_exec  )
virtual

execution method of primal heuristic

Searches for feasible primal solutions. The method is called in the node processing loop.

possible return values for *result:

  • SCIP_FOUNDSOL : at least one feasible primal solution was found
  • SCIP_DIDNOTFIND : the heuristic searched, but did not find a feasible solution
  • SCIP_DIDNOTRUN : the heuristic was skipped
  • SCIP_DELAYED : the heuristic was skipped, but should be called again as soon as possible, disregarding its frequency

Referenced by ~HeurFarthestInsert().

virtual tsp::HeurFarthestInsert::SCIP_DECL_HEUREXIT ( scip_exit  )
virtual

deinitialization method of primal heuristic (called before transformed problem is freed)

Referenced by ~HeurFarthestInsert().

virtual tsp::HeurFarthestInsert::SCIP_DECL_HEUREXITSOL ( scip_exitsol  )
virtual

solving process deinitialization method of primal heuristic (called before branch and bound process data is freed)

This method is called before the branch and bound process is freed. The primal heuristic should use this call to clean up its branch and bound data.

Referenced by ~HeurFarthestInsert().

virtual tsp::HeurFarthestInsert::SCIP_DECL_HEURFREE ( scip_free  )
virtual

destructor of primal heuristic to free user data (called when SCIP is exiting)

Referenced by ~HeurFarthestInsert().

virtual tsp::HeurFarthestInsert::SCIP_DECL_HEURINIT ( scip_init  )
virtual

initialization method of primal heuristic (called after problem was transformed)

Referenced by ~HeurFarthestInsert().

virtual tsp::HeurFarthestInsert::SCIP_DECL_HEURINITSOL ( scip_initsol  )
virtual

solving process initialization method of primal heuristic (called when branch and bound process is about to begin)

This method is called when the presolving was finished and the branch and bound process is about to begin. The primal heuristic may use this call to initialize its branch and bound specific data.

Referenced by ~HeurFarthestInsert().

virtual tsp::HeurFarthestInsert::SCIP_DECL_HEURISCLONEABLE ( iscloneable  )
inlinevirtual

returns whether the objective plugin is copyable

Definition at line 96 of file HeurFarthestInsert.h.