Home
last modified time | relevance | path

Searched refs:ncovervars (Results 1 – 2 of 2) sorted by relevance

/dports/math/SCIP/scip-7.0.3/src/scip/
H A Dheur_nlpdiving.c1293 for( c = 0; c < ncovervars; c++) in doSolveSubMIP()
1422 retcode = doSolveSubMIP(scip, subscip, heur, covervars, ncovervars, success); in solveSubMIP()
1665 int ncovervars; in SCIP_DECL_HEUREXEC() local
1946 ncovervars = -1; in SCIP_DECL_HEUREXEC()
1956 assert(ncovervars >= 0); in SCIP_DECL_HEUREXEC()
1962 for( c = 0; c < ncovervars; c++ ) in SCIP_DECL_HEUREXEC()
1982 ncovervars = 0; in SCIP_DECL_HEUREXEC()
2303 (heurdata->nfixedcovervars == ncovervars || in SCIP_DECL_HEUREXEC()
2313 if( heurdata->nfixedcovervars != ncovervars ) in SCIP_DECL_HEUREXEC()
2316 for( c = 0; c < ncovervars && !cutoff ; c++ ) in SCIP_DECL_HEUREXEC()
[all …]
H A Dcons_knapsack.c2397 *ncovervars = 0; in getCover()
2540 (*ncovervars)++; in getCover()
2586 assert(ncovervars > 0); in checkMinweightidx()
2628 assert(ncovervars >= 0); in getPartitionCovervars()
4639 assert(ncovervars > 0 && ncovervars <= nvars); in superadditiveUpLifting()
5277 assert(*ncovervars > 0); in makeCoverMinimal()
5356 (*ncovervars)--; in makeCoverMinimal()
5430 assert(*ncovervars > 0); in getFeasibleSet()
5469 while( *ncovervars >= 2 ) in getFeasibleSet()
5479 (*ncovervars)--; in getFeasibleSet()
[all …]