assert(branchrule !=
NULL);
135assert(result !=
NULL);
142assert(probdata !=
NULL);
148 for( i = 0; i < nitems; ++i )
155assert(nlpcands > 0);
158 for( v = 0; v < nlpcands; ++v )
162assert(lpcands[v] !=
NULL);
164solval = lpcandsfrac[v];
171assert(nconsids > 0);
174 for( i = 0; i < nconsids; ++i )
179pairweights[id1][id1] += solval;
182 for( j = i+1; j < nconsids; ++j )
187pairweights[id2][id1] += solval;
199 for( i = 0; i < nitems; ++i )
201 for( j = 0; j < i; ++j )
203value =
MIN(pairweights[i][j], 1-pairweights[i][j]);
205 if( bestvalue < value )
215assert( id1 >= 0 && id1 < nitems);
216assert( id2 >= 0 && id2 < nitems);
219 for( i = 0; i < nitems; ++i )
265branchruledata =
NULL;
270assert(branchrule !=
NULL);
static SCIP_DECL_BRANCHEXECLP(branchExeclpRyanFoster)
SCIP_RETCODE SCIPincludeBranchruleRyanFoster(SCIP *scip)
#define BRANCHRULE_PRIORITY
#define BRANCHRULE_MAXDEPTH
#define BRANCHRULE_MAXBOUNDDIST
Ryan/Foster branching rule.
SCIP_RETCODE SCIPcreateConsSamediff(SCIP *scip, SCIP_CONS **cons, const char *name, int itemid1, int itemid2, CONSTYPE type, SCIP_NODE *node, SCIP_Bool local)
Constraint handler stores the local branching decision data.
#define SCIP_LONGINT_FORMAT
SCIP_PROBDATA * SCIPgetProbData(SCIP *scip)
SCIP_RETCODE SCIPaddConsNode(SCIP *scip, SCIP_NODE *node, SCIP_CONS *cons, SCIP_NODE *validnode)
SCIP_Real SCIPgetLocalTransEstimate(SCIP *scip)
SCIP_RETCODE SCIPsetBranchruleExecLp(SCIP *scip, SCIP_BRANCHRULE *branchrule, SCIP_DECL_BRANCHEXECLP((*branchexeclp)))
SCIP_RETCODE SCIPincludeBranchruleBasic(SCIP *scip, SCIP_BRANCHRULE **branchruleptr, const char *name, const char *desc, int priority, int maxdepth, SCIP_Real maxbounddist, SCIP_BRANCHRULEDATA *branchruledata)
const char * SCIPbranchruleGetName(SCIP_BRANCHRULE *branchrule)
SCIP_RETCODE SCIPgetLPBranchCands(SCIP *scip, SCIP_VAR ***lpcands, SCIP_Real **lpcandssol, SCIP_Real **lpcandsfrac, int *nlpcands, int *npriolpcands, int *nfracimplvars)
SCIP_RETCODE SCIPcreateChild(SCIP *scip, SCIP_NODE **node, SCIP_Real nodeselprio, SCIP_Real estimate)
SCIP_RETCODE SCIPreleaseCons(SCIP *scip, SCIP_CONS **cons)
#define SCIPallocClearBufferArray(scip, ptr, num)
#define SCIPallocBufferArray(scip, ptr, num)
#define SCIPfreeBufferArray(scip, ptr)
SCIP_Longint SCIPgetNNodes(SCIP *scip)
SCIP_Bool SCIPisFeasGE(SCIP *scip, SCIP_Real val1, SCIP_Real val2)
SCIP_Bool SCIPisFeasPositive(SCIP *scip, SCIP_Real val)
int SCIPgetDepth(SCIP *scip)
SCIP_VARDATA * SCIPvarGetData(SCIP_VAR *var)
int * SCIPprobdataGetIds(SCIP_PROBDATA *probdata)
int SCIPprobdataGetNItems(SCIP_PROBDATA *probdata)
Problem data for binpacking problem.
struct SCIP_BranchruleData SCIP_BRANCHRULEDATA
struct SCIP_ProbData SCIP_PROBDATA
enum SCIP_Retcode SCIP_RETCODE
struct SCIP_VarData SCIP_VARDATA
int * SCIPvardataGetConsids(SCIP_VARDATA *vardata)
int SCIPvardataGetNConsids(SCIP_VARDATA *vardata)
Variable data containing the ids of constraints in which the variable appears.
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