/dports/math/SCIP/scip-7.0.3/tests/src/cons/superindicator/ |
H A D | slack.c | 152 int norigvars; in SCIPsolveSlack() local 266 norigvars = SCIPgetNVars(scip); in SCIPsolveSlack() 267 SCIP_CALL( SCIPallocMemoryArray(scip, &origobjvals, norigvars) ); in SCIPsolveSlack() 268 SCIP_CALL( SCIPallocMemoryArray(scip, &origvars, norigvars) ); in SCIPsolveSlack() 270 assert(norigvars != 0); in SCIPsolveSlack() 275 SCIP_CALL( copyVarsAndObjVals(SCIPgetVars(scip), origvars, origobjvals, norigvars) ); in SCIPsolveSlack() 836 for(c = 0; c < norigvars ; ++c) in SCIPsolveSlack()
|
/dports/math/SCIP/scip-7.0.3/src/scip/ |
H A D | cons_countsols.c | 1451 int norigvars; in SCIP_DECL_CONSINIT() local 1456 norigvars = SCIPgetNOrigVars(scip); in SCIP_DECL_CONSINIT() 1466 for( v = 0; v < norigvars; ++v ) in SCIP_DECL_CONSINIT() 2371 int norigvars; in SCIP_DECL_DIALOGEXEC() local 2389 norigvars = 0; in SCIP_DECL_DIALOGEXEC() 2395 origvars[norigvars] = SCIPgetOrigVars(scip)[v]; in SCIP_DECL_DIALOGEXEC() 2396 norigvars++; in SCIP_DECL_DIALOGEXEC() 2399 assert(norigvars == conshdlrdata->nallvars); in SCIP_DECL_DIALOGEXEC() 2401 retcode = SCIPduplicateBufferArray(scip, &allvars, conshdlrdata->allvars, norigvars); in SCIP_DECL_DIALOGEXEC() 2409 SCIPsortDownPtrPtr((void**)allvars, (void**)origvars, varCompProbindex, norigvars); in SCIP_DECL_DIALOGEXEC() [all …]
|
H A D | heur_repair.c | 116 int norigvars; /**< number of all variables in the given problem */ member 611 heurdata->norigvars++; in applyRepair() 1060 heurdata->norigvars = 0; in SCIP_DECL_HEURINIT() 1101 nvars = heurdata->norigvars; in SCIP_DECL_HEUREXIT() 1117 heurdata->relviolatedvars = MAX((SCIP_Real)heurdata->norigvars, 1.0); in SCIP_DECL_HEUREXIT() 1122 heurdata->relvarfixed = MAX((SCIP_Real)heurdata->norigvars, 1.0); in SCIP_DECL_HEUREXIT()
|
H A D | reopt.h | 109 int norigvars, /**< number of original variables */ 199 int norigvars /**< number of original problem variables */
|
H A D | scip_sol.c | 694 …int norigvars, /**< number of original problem variables of main SCIP */ in setupAndSolveFiniteSolSubscip() argument 713 SCIP_CALL( SCIPhashmapCreate(&varmap, SCIPblkmem(scip), norigvars) ); in setupAndSolveFiniteSolSubscip() 721 for( v = 0; v < norigvars; ++v ) in setupAndSolveFiniteSolSubscip() 799 for( v = 0; v < norigvars; ++v ) in setupAndSolveFiniteSolSubscip() 853 int norigvars; in SCIPcreateFiniteSolCopy() local 871 SCIP_CALL( SCIPgetOrigVarsData(scip, &origvars, &norigvars, NULL, NULL, NULL, NULL) ); in SCIPcreateFiniteSolCopy() 872 SCIP_CALL( SCIPallocBufferArray(scip, &solvals, norigvars) ); in SCIPcreateFiniteSolCopy() 873 SCIP_CALL( SCIPgetSolVals(scip, sourcesol, norigvars, origvars, solvals) ); in SCIPcreateFiniteSolCopy() 900 for( v = 0; v < norigvars; ++v ) in SCIPcreateFiniteSolCopy() 920 retcode = setupAndSolveFiniteSolSubscip(scip, subscip, origvars, norigvars, solvals, success); in SCIPcreateFiniteSolCopy() [all …]
|
H A D | scip_dcmp.c | 88 int norigvars; in getVarbufSize() local 91 norigvars = SCIPgetNOrigVars(scip); in getVarbufSize() 94 return 2 * MAX(norigvars, ntransvars); in getVarbufSize()
|
H A D | primal.c | 1817 int norigvars; in SCIPprimalTransformSol() local 1829 norigvars = origprob->nvars; in SCIPprimalTransformSol() 1861 for( v = 0; v < norigvars && feasible; ++v ) in SCIPprimalTransformSol()
|
H A D | reopt.c | 4718 int norigvars /**< number of original problem variables */ in reoptSaveNewObj() argument 4728 assert(norigvars >= 0); in reoptSaveNewObj() 4734 if( reopt->nobjvars < norigvars ) in reoptSaveNewObj() 4739 SCIP_ALLOC( BMSreallocMemoryArray(&reopt->objs[i], norigvars) ); /*lint !e866*/ in reoptSaveNewObj() 4740 for( v = reopt->nobjvars-1; v < norigvars; v++ ) in reoptSaveNewObj() 4743 reopt->nobjvars = norigvars; in reoptSaveNewObj() 4748 for( v = 0; v < norigvars; v++ ) in reoptSaveNewObj() 5421 int norigvars, /**< number of original variables */ in SCIPreoptAddRun() argument 5444 SCIP_CALL( reoptSaveNewObj(reopt, set, blkmem, origvars, norigvars) ); in SCIPreoptAddRun() 5694 assert(norigvars >= 0); in SCIPreoptGetSimilarity() [all …]
|
H A D | scip_prob.c | 1126 int norigvars; in SCIPchgReoptObjective() local 1135 norigvars = scip->origprob->nvars; in SCIPchgReoptObjective() 1148 for( i = 0; i < norigvars; i++ ) in SCIPchgReoptObjective() 1193 for( i = 0; i < norigvars; i++ ) in SCIPchgReoptObjective()
|
H A D | cons_knapsack.c | 6985 int norigvars; in stableSort() local 7006 norigvars = consdata->nvars; in stableSort() 7008 assert(origvars != NULL || norigvars == 0); in stableSort() 7009 assert(origweights != NULL || norigvars == 0); in stableSort() 7011 if( norigvars == 0 ) in stableSort() 7037 for( v = norigvars - 1; v >= 0; --v ) in stableSort() 7046 BMSclearMemoryArray(vars, norigvars); in stableSort() 7047 BMSclearMemoryArray(weights, norigvars); in stableSort() 7070 assert(nextpos == norigvars); in stableSort() 7074 for( v = 0; v < norigvars; ++v ) in stableSort() [all …]
|
/dports/math/SCIP/scip-7.0.3/applications/MinIISC/src/ |
H A D | miniisc.c | 673 int norigvars; in solveMinIISC() local 775 norigvars = SCIPgetNOrigVars(origscip); in solveMinIISC() 781 for (v = 0; v < norigvars; ++v) in solveMinIISC() 795 for (v = 0; v < norigvars; ++v) in solveMinIISC()
|
H A D | classify.c | 919 int norigvars; in solveClassification() local 1042 norigvars = SCIPgetNOrigVars(origscip); in solveClassification() 1048 for (v = 0; v < norigvars; ++v) in solveClassification() 1062 for (v = 0; v < norigvars; ++v) in solveClassification()
|
/dports/math/SCIP/scip-7.0.3/examples/Binpacking/src/ |
H A D | pricer_binpacking.c | 226 int norigvars; in addFixedVarsConss() local 246 norigvars = SCIPgetNVars(scip); in addFixedVarsConss() 249 for( v = 0; v < norigvars; ++v ) in addFixedVarsConss()
|
/dports/math/SCIP/scip-7.0.3/applications/STP/src/ |
H A D | probdata_stp.c | 3389 int norigvars; in SCIPprobdataAddNewSol() local 3394 norigvars = SCIPgetNOrigVars(scip); in SCIPprobdataAddNewSol() 3396 for( v = 0; v < norigvars; ++v ) in SCIPprobdataAddNewSol()
|