Heur2opt.cpp
Go to the documentation of this file.
21 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
77 /** solving process initialization method of primal heuristic (called when branch and bound process is about to begin)
79 * This method is called when the presolving was finished and the branch and bound process is about to begin.
97 /** solving process deinitialization method of primal heuristic (called before branch and bound process data is freed)
189 /* test current edge with all 'longer' edges for improvement if swapping with crossing edges (though do 2Opt for one edge) */
200 if( edges2test[0]->length + edges2test[1]->length > edges2test[2]->length + edges2test[3]->length
Definition: type_result.h:33
Definition: type_result.h:47
SCIP_RETCODE SCIPsetSolVal(SCIP *scip, SCIP_SOL *sol, SCIP_VAR *var, SCIP_Real val)
Definition: scip_sol.c:1213
2-Optimum - combinatorial improvement heuristic for TSP
SCIP_Real SCIPgetSolVal(SCIP *scip, SCIP_SOL *sol, SCIP_VAR *var)
Definition: scip_sol.c:1353
generator for global cuts in undirected graphs
SCIP_RETCODE SCIPcreateSol(SCIP *scip, SCIP_SOL **sol, SCIP_HEUR *heur)
Definition: scip_sol.c:320
Definition: struct_sol.h:64
Definition: ProbDataTSP.h:33
Definition: type_result.h:35
Definition: pqueue.h:28
C++ wrapper classes for SCIP.
static GRAPHEDGE * findEdge(GRAPHNODE *nodes, GRAPHNODE *node1, GRAPHNODE *node2)
Definition: Heur2opt.cpp:37
Definition: type_retcode.h:33
C++ problem data for TSP.
SCIP_RETCODE SCIPaddSolFree(SCIP *scip, SCIP_SOL **sol, SCIP_Bool *stored)
Definition: scip_sol.c:3015
SCIP_DECL_HEURCLONE(scip::ObjCloneable *Heur2opt::clone)
Definition: Heur2opt.cpp:236
Definition: GomoryHuTree.h:31
Definition: GomoryHuTree.h:54
Definition: Heur2opt.h:32
Definition: ConshdlrSubtour.h:29
Definition: objbenders.h:33