Home
last modified time | relevance | path

Searched refs:maxnsols (Results 1 – 5 of 5) sorted by relevance

/dports/math/SCIP/scip-7.0.3/src/scip/
H A Dheur_sync.c54 int maxnsols; /**< maximum number of solutions that can be stored */ member
78 SCIPfreeBlockMemoryArray(scip, &heurdata->sols, heurdata->maxnsols); in SCIP_DECL_HEURFREE()
161 SCIP_CALL( SCIPgetIntParam(scip, "concurrent/sync/maxnsols", &heurdata->maxnsols) ); in SCIPincludeHeurSync()
162 SCIP_CALL( SCIPallocBlockMemoryArray(scip, &heurdata->sols, heurdata->maxnsols) ); in SCIPincludeHeurSync()
205 if( heurdata->nsols < heurdata->maxnsols ) in SCIPheurSyncPassSol()
252 assert(heurdata->nsols <= heurdata->maxnsols); in SCIPheurSyncPassSol()
H A Dsyncstore.c144 SCIP_CALL( SCIPgetIntParam(scip, "concurrent/sync/maxnsols", &syncstore->maxnsols) ); in SCIPsyncstoreInit()
156 …PallocBlockMemoryArray(syncstore->mainscip, &syncstore->syncdata[i].solobj, syncstore->maxnsols) ); in SCIPsyncstoreInit()
157 …locBlockMemoryArray(syncstore->mainscip, &syncstore->syncdata[i].solsource, syncstore->maxnsols) ); in SCIPsyncstoreInit()
158 …CIPallocBlockMemoryArray(syncstore->mainscip, &syncstore->syncdata[i].sols, syncstore->maxnsols) ); in SCIPsyncstoreInit()
160 for( j = 0; j < syncstore->maxnsols; ++j ) in SCIPsyncstoreInit()
207 …SCIPfreeBlockMemoryArray(syncstore->mainscip, &syncstore->syncdata[i].solobj, syncstore->maxnsols); in SCIPsyncstoreExit()
208 …PfreeBlockMemoryArray(syncstore->mainscip, &syncstore->syncdata[i].solsource, syncstore->maxnsols); in SCIPsyncstoreExit()
211 for( j = 0; j < syncstore->maxnsols; ++j ) in SCIPsyncstoreExit()
216 … SCIPfreeBlockMemoryArray(syncstore->mainscip, &syncstore->syncdata[i].sols, syncstore->maxnsols); in SCIPsyncstoreExit()
722 if( syncdata->nsols < syncstore->maxnsols ) in SCIPsyncdataGetSolutionBuffer()
H A Dstruct_syncstore.h63 …int maxnsols; /**< maximum number of solutions that can be shared in o… member
/dports/math/SCIP/scip-7.0.3/applications/STP/src/
H A Dheur_rec.c190 int maxnsols = heurdata->maxnsols; in selectdiffsols() local
249 maxnsols = MIN(nsols, maxnsols); in selectdiffsols()
255 if( sqrtnallsols >= REC_MIN_NSOLS && sqrtnallsols < maxnsols ) in selectdiffsols()
256 maxnsols = sqrtnallsols; in selectdiffsols()
351 int maxnsols; in selectsols() local
371 maxnsols = heurdata->maxnsols; in selectsols()
426 maxnsols = MIN(nsols, maxnsols); in selectsols()
432 if( sqrtnallsols >= REC_MIN_NSOLS && sqrtnallsols < maxnsols ) in selectsols()
433 maxnsols = sqrtnallsols; in selectsols()
436 SCIPdebugMessage("maxnsols in REC %d \n", maxnsols); in selectsols()
[all …]
H A Dheur_local.c72 int maxnsols; /**< maximal number of best solutions to improve */ member
2010 SCIP_CALL( SCIPallocMemoryArray(scip, &(heurdata->lastsolindices), heurdata->maxnsols) ); in SCIP_DECL_HEURINITSOL()
2012 for( int i = 0; i < heurdata->maxnsols; i++ ) in SCIP_DECL_HEURINITSOL()
2104 assert(heurdata->maxnsols >= 0); in SCIP_DECL_HEUREXEC()
2106 min = MIN(heurdata->maxnsols, nsols); in SCIP_DECL_HEUREXEC()
2241 …if( heurdata->nbestsols < heurdata->maxnsols && SCIPisGT(scip, SCIPgetSolOrigObj(scip, bestsol) - … in SCIP_DECL_HEUREXEC()
2306 &heurdata->maxnsols, FALSE, DEFAULT_MAXNBESTSOLS, 1, 50, NULL, NULL) ); in SCIPStpIncludeHeurLocal()