Detailed DescriptionPrimal recombination heuristic for Steiner problems. This file implements a recombination heuristic for Steiner problems, see "SCIP-Jack - A solver for STP and variants with parallelization extensions" by Gamrath, Koch, Maher, Rehfeldt and Shinano A list of all interface methods can be found in heur_rec.h Definition in file heur_rec.c. #include <assert.h>#include <string.h>#include <stdio.h>#include "scip/scip.h"#include "scip/scipdefplugins.h"#include "scip/cons_linear.h"#include "heur_rec.h"#include "heur_local.h"#include "grph.h"#include "heur_tm.h"#include "cons_stp.h"#include "scip/pub_misc.h"#include "probdata_stp.h"Go to the source code of this file.
Macro Definition Documentation
executions of the rec heuristic at maximum frequency? Definition at line 54 of file heur_rec.c. Referenced by SCIPincludeHeurRec().
maximum number of (good) solutions be regarded in the subproblem Definition at line 55 of file heur_rec.c. Referenced by SCIPincludeHeurRec().
number of runs in TM heuristic Definition at line 58 of file heur_rec.c. Referenced by SCIPincludeHeurRec().
number of solutions that will be taken into account Definition at line 56 of file heur_rec.c. Referenced by SCIP_DECL_HEUREXEC(), and SCIPincludeHeurRec().
max number of new solutions to be available before executing the heuristic again Definition at line 59 of file heur_rec.c. Referenced by SCIPincludeHeurRec().
Definition at line 45 of file heur_rec.c. Referenced by SCIPincludeHeurRec().
Definition at line 46 of file heur_rec.c. Referenced by SCIPincludeHeurRec().
Definition at line 48 of file heur_rec.c. Referenced by SCIPincludeHeurRec().
Definition at line 49 of file heur_rec.c. Referenced by SCIPincludeHeurRec().
Definition at line 50 of file heur_rec.c. Referenced by SCIPincludeHeurRec().
Definition at line 44 of file heur_rec.c. Referenced by SCIP_DECL_HEURCOPY(), SCIP_DECL_HEUREXEC(), and SCIPincludeHeurRec().
Definition at line 47 of file heur_rec.c. Referenced by SCIPincludeHeurRec().
Definition at line 51 of file heur_rec.c. Referenced by SCIPincludeHeurRec().
does the heuristic use a secondary SCIP instance? Definition at line 52 of file heur_rec.c. Referenced by SCIPincludeHeurRec(). Function Documentation
merge selected solutions to a new graph
Definition at line 451 of file heur_rec.c. References GRAPH::cost, EAT_LAST, GRAPH::edges, FALSE, FARAWAY, flipedge, graph_edge_add(), graph_init(), graph_knot_add(), GSTP, GRAPH::head, GRAPH::hoplimit, GRAPH::ieat, GRAPH::inpbeg, Is_gterm, Is_pterm, Is_term, GRAPH::knots, GRAPH::maxdeg, GRAPH::oeat, GRAPH::outbeg, GRAPH::prize, SCIPprobdataGetEdgeVars(), selectdiffsols(), selectsols(), GRAPH::source, STP_DEG_CONS, STP_GRID, STP_MAX_NODE_WEIGHT, STP_OBSTACLES_GRID, STP_PRIZE_COLLECTING, STP_ROOTED_PRIZE_COLLECTING, GRAPH::stp_type, STP_UNDIRECTED, GRAPH::tail, GRAPH::term, TRUE, and UNKNOWN. Referenced by SCIP_DECL_HEUREXEC().
edge cost multiplier
Definition at line 112 of file heur_rec.c. References SCIP_HeurData::nusedsols. Referenced by SCIP_DECL_HEUREXEC().
copy method for primal heuristic plugins (called when SCIP copies plugins) Definition at line 702 of file heur_rec.c. References HEUR_NAME, and SCIPincludeHeurRec().
execution method of primal heuristic Definition at line 767 of file heur_rec.c. References GRAPH::ancestors, BLOCKED, buildsolgraph(), CONNECT, GRAPH::cost, costMultiplier(), DEFAULT_NUSEDSOLS, GRAPH::edges, FALSE, GRAPH::fixedges, flipedge, graph_free(), graph_pack(), graph_path_exit(), graph_path_init(), graph_sol_valid(), graph_valid(), GRAPH::head, HEUR_NAME, SCIP_HeurData::hopfactor, Int_List_Node::index, GRAPH::knots, SCIP_HeurData::lastsolindex, SCIP_HeurData::nlastsols, Int_List_Node::parent, reduce(), SCIPheurComputeSteinerTree(), SCIPheurImproveSteinerTree(), SCIPheurPruneDegConsSteinerTree(), SCIPheurPrunePCSteinerTree(), SCIPheurPruneSteinerTree(), SCIPprobdataAddNewSol(), SCIPprobdataGetGraph(), SCIPprobdataGetOffset(), SCIPprobdataGetVars(), GRAPH::source, STP_DEG_CONS, STP_HOP_CONS, STP_MAX_NODE_WEIGHT, STP_PRIZE_COLLECTING, STP_ROOTED_PRIZE_COLLECTING, GRAPH::stp_type, STP_UNDIRECTED, GRAPH::tail, GRAPH::terms, TRUE, and UNKNOWN.
destructor of primal heuristic to free user data (called when SCIP is exiting) Definition at line 716 of file heur_rec.c.
initialization method of primal heuristic (called after problem was transformed) Definition at line 736 of file heur_rec.c.
information method for a parameter change of random seed Definition at line 95 of file heur_rec.c.
creates the rec primal heuristic and includes it in SCIP
Definition at line 1236 of file heur_rec.c. References DEFAULT_MAXFREQREC, DEFAULT_MAXNSOLS, DEFAULT_NTMRUNS, DEFAULT_NUSEDSOLS, DEFAULT_NWAITINGSOLS, DEFAULT_RANDSEED, FALSE, HEUR_DESC, HEUR_DISPCHAR, HEUR_FREQ, HEUR_FREQOFS, HEUR_MAXDEPTH, HEUR_NAME, HEUR_PRIORITY, HEUR_TIMING, and HEUR_USESSUBSCIP. Referenced by runShell(), and SCIP_DECL_HEURCOPY().
select solutions to be merged
Definition at line 170 of file heur_rec.c. References GRAPH::edges, FALSE, GRAPH::head, Is_term, SCIP_HeurData::maxnsols, SCIP_HeurData::nselectedsols, SCIP_HeurData::nusedsols, GRAPH::tail, GRAPH::term, and TRUE. Referenced by buildsolgraph().
select solutions to be merged
Definition at line 329 of file heur_rec.c. References FALSE, SCIP_HeurData::maxnsols, SCIP_HeurData::nselectedsols, SCIP_HeurData::nusedsols, and TRUE. Referenced by buildsolgraph(). |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||