SCIP
Solving Constraint Integer Programs
HeurFrats.cpp File Reference
Detailed Description
fractional travelling salesman heuristic - Rounding heuristic for TSP
Definition in file HeurFrats.cpp.
Go to the source code of this file.
Functions | |
| SCIP_DECL_HEURFREE (HeurFrats::scip_free) | |
| SCIP_DECL_HEURINIT (HeurFrats::scip_init) | |
| SCIP_DECL_HEUREXIT (HeurFrats::scip_exit) | |
| SCIP_DECL_HEURINITSOL (HeurFrats::scip_initsol) | |
| SCIP_DECL_HEUREXITSOL (HeurFrats::scip_exitsol) | |
| SCIP_DECL_HEUREXEC (HeurFrats::scip_exec) | |
| SCIP_DECL_HEURCLONE (scip::ObjCloneable *HeurFrats::clone) | |
Function Documentation
◆ SCIP_DECL_HEURFREE()
| SCIP_DECL_HEURFREE | ( | HeurFrats::scip_free | ) |
destructor of primal heuristic to free user data (called when SCIP is exiting)
Definition at line 40 of file HeurFrats.cpp.
References SCIP_OKAY.
◆ SCIP_DECL_HEURINIT()
| SCIP_DECL_HEURINIT | ( | HeurFrats::scip_init | ) |
initialization method of primal heuristic (called after problem was transformed)
Definition at line 46 of file HeurFrats.cpp.
References capture_graph(), tsp::ProbDataTSP::getGraph(), NULL, SCIP_CALL, SCIP_OKAY, SCIPcreateSol(), and SCIPgetObjProbData().
◆ SCIP_DECL_HEUREXIT()
| SCIP_DECL_HEUREXIT | ( | HeurFrats::scip_exit | ) |
deinitialization method of primal heuristic (called before transformed problem is freed)
Definition at line 66 of file HeurFrats.cpp.
References release_graph(), SCIP_CALL, SCIP_OKAY, and SCIPfreeSol().
◆ SCIP_DECL_HEURINITSOL()
| SCIP_DECL_HEURINITSOL | ( | HeurFrats::scip_initsol | ) |
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.
Definition at line 81 of file HeurFrats.cpp.
References SCIP_OKAY.
◆ SCIP_DECL_HEUREXITSOL()
| SCIP_DECL_HEUREXITSOL | ( | HeurFrats::scip_exitsol | ) |
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.
Definition at line 91 of file HeurFrats.cpp.
References SCIP_OKAY.
◆ SCIP_DECL_HEUREXEC()
| SCIP_DECL_HEUREXEC | ( | HeurFrats::scip_exec | ) |
execution method of primal heuristic
Definition at line 97 of file HeurFrats.cpp.
References GraphEdge::adjac, BMSclearMemoryArray, FALSE, GraphNode::first_edge, GraphNode::id, GraphEdge::next, nnodes, NULL, SCIP_Bool, SCIP_CALL, SCIP_DIDNOTFIND, SCIP_DIDNOTRUN, SCIP_FOUNDSOL, SCIP_LPSOLSTAT_OPTIMAL, SCIP_OKAY, SCIP_Real, SCIPallocBufferArray, SCIPcreateSol(), SCIPfreeBufferArray, SCIPfreeSol(), SCIPgetLPSolstat(), SCIPgetSolVal(), SCIPhasCurrentNodeLP(), SCIPisFeasLE(), SCIPlinkLPSol(), SCIPsetSolVal(), SCIPtrySol(), SCIPvarGetUbGlobal(), TRUE, and GraphEdge::var.
◆ SCIP_DECL_HEURCLONE()
| SCIP_DECL_HEURCLONE | ( | scip::ObjCloneable *HeurFrats::clone | ) |
clone method which will be used to copy a objective plugin
Definition at line 230 of file HeurFrats.cpp.