SCIP_NodeselData
78assert(nodesel !=
NULL);
97assert(nodeseldata !=
NULL);
114assert(nodeseldata !=
NULL);
117nodeseldata->lastrestart = 0;
118nodeseldata->nprocessedleaves = 0;
129assert(selnode !=
NULL);
133 if( *selnode ==
NULL)
140assert(nodeseldata !=
NULL);
143nodeseldata->nprocessedleaves++;
150 if( (nodeseldata->countonlyleaves && nodeseldata->nprocessedleaves >= nodeseldata->selectbestfreq)
151|| (!nodeseldata->countonlyleaves &&
nnodes- nodeseldata->lastrestart >= nodeseldata->selectbestfreq ) )
153nodeseldata->lastrestart =
nnodes;
154nodeseldata->nprocessedleaves = 0;
160 if( *selnode ==
NULL)
191nodeseldata->lastrestart = 0;
192nodeseldata->nprocessedleaves = 0;
198nodeselSelectRestartdfs, nodeselCompRestartdfs, nodeseldata) );
200assert(nodesel !=
NULL);
208 "nodeselection/restartdfs/selectbestfreq",
209 "frequency for selecting the best node instead of the deepest one",
214 "nodeselection/restartdfs/countonlyleaves",
215 "count only leaf nodes (otherwise all nodes)?",
SCIP_RETCODE SCIPincludeNodeselRestartdfs(SCIP *scip)
SCIP_RETCODE SCIPaddIntParam(SCIP *scip, const char *name, const char *desc, int *valueptr, SCIP_Bool isadvanced, int defaultvalue, int minvalue, int maxvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)
SCIP_RETCODE SCIPaddBoolParam(SCIP *scip, const char *name, const char *desc, SCIP_Bool *valueptr, SCIP_Bool isadvanced, SCIP_Bool defaultvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)
#define SCIPfreeBlockMemory(scip, ptr)
#define SCIPallocBlockMemory(scip, ptr)
SCIP_Longint SCIPnodeGetNumber(SCIP_NODE *node)
SCIP_RETCODE SCIPincludeNodeselBasic(SCIP *scip, SCIP_NODESEL **nodesel, const char *name, const char *desc, int stdpriority, int memsavepriority, SCIP_DECL_NODESELSELECT((*nodeselselect)), SCIP_DECL_NODESELCOMP((*nodeselcomp)), SCIP_NODESELDATA *nodeseldata)
void SCIPnodeselSetData(SCIP_NODESEL *nodesel, SCIP_NODESELDATA *nodeseldata)
SCIP_RETCODE SCIPsetNodeselFree(SCIP *scip, SCIP_NODESEL *nodesel, SCIP_DECL_NODESELFREE((*nodeselfree)))
SCIP_NODESELDATA * SCIPnodeselGetData(SCIP_NODESEL *nodesel)
SCIP_RETCODE SCIPsetNodeselCopy(SCIP *scip, SCIP_NODESEL *nodesel, SCIP_DECL_NODESELCOPY((*nodeselcopy)))
const char * SCIPnodeselGetName(SCIP_NODESEL *nodesel)
SCIP_RETCODE SCIPsetNodeselInitsol(SCIP *scip, SCIP_NODESEL *nodesel, SCIP_DECL_NODESELINITSOL((*nodeselinitsol)))
SCIP_Longint SCIPgetNNodes(SCIP *scip)
SCIP_NODE * SCIPgetPrioSibling(SCIP *scip)
SCIP_NODE * SCIPgetBestboundNode(SCIP *scip)
SCIP_NODE * SCIPgetPrioChild(SCIP *scip)
SCIP_NODE * SCIPgetBestLeaf(SCIP *scip)
static SCIP_DECL_NODESELCOMP(nodeselCompRestartdfs)
static SCIP_DECL_NODESELCOPY(nodeselCopyRestartdfs)
static SCIP_DECL_NODESELFREE(nodeselFreeRestartdfs)
static SCIP_DECL_NODESELSELECT(nodeselSelectRestartdfs)
#define NODESEL_MEMSAVEPRIORITY
#define NODESEL_STDPRIORITY
static SCIP_DECL_NODESELINITSOL(nodeselInitsolRestartdfs)
node selector for depth first search with periodical selection of the best node
public methods for message output
public methods for node selectors
public methods for branch and bound tree
public methods for memory management
public methods for node selector plugins
public methods for SCIP parameter handling
public methods for querying solving statistics
public methods for the branch-and-bound tree
struct SCIP_NodeselData SCIP_NODESELDATA
enum SCIP_Retcode SCIP_RETCODE
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4