Home
last modified time | relevance | path

Searched refs:nconss (Results 1 – 25 of 132) sorted by relevance

123456

/dports/math/SCIP/scip-7.0.3/src/scip/
H A Dcons_conjunction.c80 if( nconss > 0 ) in consdataCreate()
84 (*consdata)->nconss = nconss; in consdataCreate()
321 targetdata->nconss = sourcedata->nconss; in SCIP_DECL_CONSTRANS()
508 int nconss; in SCIP_DECL_CONSPARSE() local
527 nconss = 0; in SCIP_DECL_CONSPARSE()
622 ++nconss; in SCIP_DECL_CONSPARSE()
670 ++nconss; in SCIP_DECL_CONSPARSE()
685 for( --nconss; nconss >= 0; --nconss ) in SCIP_DECL_CONSPARSE()
705 int nconss; in SCIP_DECL_CONSCOPY() local
714 nconss = sourcedata->nconss; in SCIP_DECL_CONSCOPY()
[all …]
H A Dcons_disjunction.c110 (*consdata)->nconss = nconss; in consdataCreate()
230 int nconss; in branchCons() local
245 nconss = consdata->nconss; in branchCons()
300 int nconss; in checkCons() local
311 nconss = consdata->nconss; in checkCons()
352 int nconss; in propagateCons() local
365 nconss = consdata->nconss; in propagateCons()
740 int nconss; in SCIP_DECL_CONSPARSE() local
759 nconss = 0; in SCIP_DECL_CONSPARSE()
929 for( --nconss; nconss >= 0; --nconss ) in SCIP_DECL_CONSPARSE()
[all …]
H A Dscip_nonlinear.c994 int nconss; in SCIPcreateNlpiProb() local
1011 nconss = 0; in SCIPcreateNlpiProb()
1081 nlininds[nconss] = 0; in SCIPcreateNlpiProb()
1094 linvals[nconss][nlininds[nconss]] = SCIPvarGetObj(vars[i]); in SCIPcreateNlpiProb()
1095 lininds[nconss][nlininds[nconss]] = i; in SCIPcreateNlpiProb()
1099 ++nconss; in SCIPcreateNlpiProb()
1194 if( quadelems[nconss][k].idx1 > quadelems[nconss][k].idx2 ) in SCIPcreateNlpiProb()
1198 assert(quadelems[nconss][k].idx1 <= quadelems[nconss][k].idx2); in SCIPcreateNlpiProb()
1204 if( quadelems[nconss][k].idx1 != quadelems[nconss][k].idx2 ) in SCIPcreateNlpiProb()
1242 ++nconss; in SCIPcreateNlpiProb()
[all …]
H A Dtype_cons.h116 …ECL_CONSINIT(x) SCIP_RETCODE x (SCIP* scip, SCIP_CONSHDLR* conshdlr, SCIP_CONS** conss, int nconss)
126 …ECL_CONSEXIT(x) SCIP_RETCODE x (SCIP* scip, SCIP_CONSHDLR* conshdlr, SCIP_CONS** conss, int nconss)
146 …_CONSINITPRE(x) SCIP_RETCODE x (SCIP* scip, SCIP_CONSHDLR* conshdlr, SCIP_CONS** conss, int nconss)
170 …_CONSEXITPRE(x) SCIP_RETCODE x (SCIP* scip, SCIP_CONSHDLR* conshdlr, SCIP_CONS** conss, int nconss)
191 …_CONSINITSOL(x) SCIP_RETCODE x (SCIP* scip, SCIP_CONSHDLR* conshdlr, SCIP_CONS** conss, int nconss)
206 …P_RETCODE x (SCIP* scip, SCIP_CONSHDLR* conshdlr, SCIP_CONS** conss, int nconss, SCIP_Bool restart)
279 int nconss, int nusefulconss, SCIP_RESULT* result)
311 int nconss, int nusefulconss, SCIP_SOL* sol, SCIP_RESULT* result)
464 …CIP_RETCODE x (SCIP* scip, SCIP_CONSHDLR* conshdlr, SCIP_CONS** conss, int nconss, SCIP_SOL* sol, \
550 … SCIP_RETCODE x (SCIP* scip, SCIP_CONSHDLR* conshdlr, SCIP_CONS** conss, int nconss, int nrounds, \
[all …]
H A Dscip_dcmp.c123 if( nconss ) in getDecompVarsConssData()
352 if( nconss == 0 ) in SCIPcomputeDecompConsLabels()
473 for( c = 0; c < nconss; ++c ) in SCIPcomputeDecompVarsLabels()
580 for( c = 0; c < nconss; c++ ) in SCIPassignDecompLinkConss()
700 int nconss; in computeModularity() local
721 for( c = 0; c < nconss; ++c ) in computeModularity()
811 int nconss; in computeAreaScore() local
815 if( nvars > 0 && nconss > 0 ) in computeAreaScore()
857 int nconss; in buildBlockGraph() local
931 while( conspos < nconss ) in buildBlockGraph()
[all …]
H A Dreader.c293 int nconss; in SCIPreaderWrite() local
314 nconss = 0; in SCIPreaderWrite()
319 nconss += SCIPconshdlrGetNConss(conshdlrs[i]); in SCIPreaderWrite()
321 nconss += SCIPconshdlrGetNEnfoConss(conshdlrs[i]); in SCIPreaderWrite()
329 nconss = 0; in SCIPreaderWrite()
352 conss[nconss] = conshdlrconss[c]; in SCIPreaderWrite()
353 nconss++; in SCIPreaderWrite()
360 nconss = prob->nconss; in SCIPreaderWrite()
406 size = (int) log10(nconss+1.0) + 3; in SCIPreaderWrite()
408 for( i = 0; i < nconss; ++i ) in SCIPreaderWrite()
[all …]
H A Dreader_dec.c120 int nconss; in readDecomposition() local
154 nconss = SCIPgetNConss(scip); in readDecomposition()
156 SCIP_CALL_TERMINATE( retcode, SCIPallocBufferArray(scip, &conss, nconss), TERMINATE ); in readDecomposition()
157 SCIP_CALL_TERMINATE( retcode, SCIPallocBufferArray(scip, &labels, nconss), TERMINATE ); in readDecomposition()
252 if( consptr == nconss ) in readDecomposition()
288 SCIPdebugMsg(scip, "Setting labels for %d constraints.\n", nconss); in readDecomposition()
292 SCIPdebugMsg(scip, "Using %d SCIP constraints for labeling variables.\n", nconss); in readDecomposition()
293 SCIP_CALL( SCIPcomputeDecompVarsLabels(scip, decomp, scip_conss, nconss) ); in readDecomposition()
H A Dreader_osil.c456 assert(nconss != NULL); in readConstraints()
461 *nconss = 0; in readConstraints()
497 if( consssize == *nconss ) in readConstraints()
585 ++*nconss; in readConstraints()
588 if( *nconss < consssize ) in readConstraints()
1175 considx = nconss; in readQuadraticCoefs()
1198 if( nterms[nconss] > 0 ) in readQuadraticCoefs()
1218 … objcons, "quadobj", 1, &objvar, &minusone, nterms[nconss], vars1[nconss], vars2[nconss], coefs[nc… in readQuadraticCoefs()
2497 int nconss; in SCIP_DECL_READERREAD() local
2514 nconss = 0; in SCIP_DECL_READERREAD()
[all …]
H A Dscip_dcmp.h103 int nconss /**< number of constraints */
126 int nconss /**< number of constraints */
142 int nconss, /**< number of constraints */
H A Dreader_pbm.c222 int nconss /**< number of constraints */ in getSubmatrixSize() argument
231 if( readerdata->maxrows > nconss ) in getSubmatrixSize()
232 readerdata->maxrows = nconss; in getSubmatrixSize()
237 sizev = (nconss + readerdata->maxrows - 1) / readerdata->maxrows; in getSubmatrixSize()
258 readerdata->maxrows = (nconss + res - 1) / res; in getSubmatrixSize()
436 …SCIP_CALL( SCIPwritePbm(scip, file, name, readerdata, transformed, nvars, conss, nconss, result) ); in SCIP_DECL_READERWRITE()
482 int nconss, /**< number of constraints in the problem */ in SCIPwritePbm() argument
505 submatrixsize = getSubmatrixSize(&readerdata_copy, nvars, nconss); in SCIPwritePbm()
523 for( c = 0; c < nconss; ++c ) in SCIPwritePbm()
H A Dcons_countsols.c873 nconss--; in checkLogicor()
948 nconss--; in checkKnapsack()
1039 nconss--; in checkBounddisjunction()
1120 nconss--; in checkVarbound()
1168 int nconss; in checkFeasSubtree() local
1196 if( nconss > 0 ) in checkFeasSubtree()
1201 SCIPconshdlrGetName(conshdlr), nconss ); in checkFeasSubtree()
1664 assert(nconss == 0); in SCIP_DECL_CONSEXITSOL()
1690 assert( nconss == 0 ); in SCIP_DECL_CONSENFOLP()
1727 assert( nconss == 0 ); in SCIP_DECL_CONSENFORELAX()
[all …]
H A Dmatrix.c467 int nconss; in SCIPmatrixCreate() local
498 nconss = 0; in SCIPmatrixCreate()
516 nconss += nconshdlrconss; in SCIPmatrixCreate()
535 if( nconss < nconssall ) in SCIPmatrixCreate()
548 if( nconss == 0 ) in SCIPmatrixCreate()
693 assert(cnt < nconss); in SCIPmatrixCreate()
743 assert(cnt < nconss); in SCIPmatrixCreate()
772 assert(cnt < nconss); in SCIPmatrixCreate()
824 assert(cnt < nconss); in SCIPmatrixCreate()
870 assert(cnt < nconss); in SCIPmatrixCreate()
[all …]
H A Ddcmp.c167 int nconss /**< length of constraints array */ in SCIPdecompSetConsLabels() argument
177 for( i = 0; i < nconss; ++i ) in SCIPdecompSetConsLabels()
192 int nconss /**< length of constraints array */ in SCIPdecompGetConsLabels() argument
202 for( i = 0; i < nconss; ++i ) in SCIPdecompGetConsLabels()
554 int nconss; in SCIPtransformDecompstore() local
606 nconss = SCIPgetNConss(scip); in SCIPtransformDecompstore()
625 SCIP_CALL( SCIPcomputeDecompConsLabels(scip, decomp, conss, nconss) ); in SCIPtransformDecompstore()
631 SCIP_CALL( SCIPcomputeDecompVarsLabels(scip, decomp, conss, nconss) ); in SCIPtransformDecompstore()
H A Dcons_indicator.c726 int nconss; in SCIP_DECL_CONFLICTEXEC() local
771 if ( j >= nconss ) in SCIP_DECL_CONFLICTEXEC()
944 for (c = 0; c < nconss; ++c) in checkIIS()
1428 for (j = 0; j < nconss; ++j) in checkLPBoundsClean()
1499 for (j = 0; j < nconss; ++j) in setAltLPObj()
1551 for (j = 0; j < nconss; ++j) in setAltLPObjZero()
2819 assert( nconss <= nCols ); in extendToCover()
3117 while (step < nconss); in extendToCover()
4392 if ( size == nconss ) in separateIISRounding()
4697 if ( nconss == 0 ) in separateIndicators()
[all …]
H A Dpresol_qpkktref.c768 int nconss; in presolveAddKKTKnapsackConss() local
787 for( c = 0; c < nconss; ++c ) in presolveAddKKTKnapsackConss()
822 for( c = nconss-1; c >= 0; --c ) in presolveAddKKTKnapsackConss()
848 int nconss; in presolveAddKKTSetppcConss() local
867 for( c = 0; c < nconss; ++c ) in presolveAddKKTSetppcConss()
921 for( c = nconss-1; c >= 0; --c ) in presolveAddKKTSetppcConss()
954 int nconss; in presolveAddKKTVarboundConss() local
973 for( c = 0; c < nconss; ++c ) in presolveAddKKTVarboundConss()
1042 int nconss; in presolveAddKKTLogicorConss() local
1061 for( c = 0; c < nconss; ++c ) in presolveAddKKTLogicorConss()
[all …]
H A Dcons_conjunction.h71 int nconss, /**< number of initial constraints in conjunction */
100 int nconss, /**< number of initial constraints in conjunction */
H A Dcons_disjunction.h72 int nconss, /**< number of initial constraints in disjunction */
104 int nconss, /**< number of initial constraints in disjunction */
H A Dheur_padm.c374 for( i = 0; i < nconss; ++i ) in copyToSubscip()
561 for( c = 0; c < nconss; c++ ) in assignLinking()
581 SCIPsortIntPtr(conslabels, (void**)sortedconss, nconss); in assignLinking()
844 int nconss; in SCIP_DECL_HEUREXEC() local
917 nconss = SCIPgetNOrigConss(scip); in SCIP_DECL_HEUREXEC()
934 nconss = SCIPgetNConss(scip); in SCIP_DECL_HEUREXEC()
943 if( nconss == 0 || nvars == 0 || nblocks <= 1 ) in SCIP_DECL_HEUREXEC()
964 SCIPdecompGetConsLabels(decomp, conss, conslabels, nconss); in SCIP_DECL_HEUREXEC()
968 SCIPsortIntPtr(conslabels, (void**)sortedconss, nconss); in SCIP_DECL_HEUREXEC()
1014 if( i == nconss ) in SCIP_DECL_HEUREXEC()
[all …]
H A Dcompr_weakcompr.c140 int* nconss; in constructCompression() local
210 SCIP_CALL( SCIPallocBufferArray(scip, &nconss, size) ); in constructCompression()
243 …eoptnodeGetConss(reoptnode, conss_var[k], conss_val[k], conss_boundtypes[k], mem_conss, &nconss[k], in constructCompression()
245 assert(mem_conss == nconss[k]); in constructCompression()
268 comprdata->nrepresentatives += nconss[0]; in constructCompression()
312 for( k = 0; k < nconss[0]; k++ ) in constructCompression()
357 SCIPfreeBufferArray(scip, &nconss); in constructCompression()
/dports/math/py-PySCIPOpt/PySCIPOpt-3.0.2/src/pyscipopt/
H A Dconshdlr.pxi165 for i in range(nconss):
173 for i in range(nconss):
181 for i in range(nconss):
189 for i in range(nconss):
197 for i in range(nconss):
205 for i in range(nconss):
241 for i in range(nconss):
250 for i in range(nconss):
260 for i in range(nconss):
272 for i in range(nconss):
[all …]
/dports/math/SCIP/scip-7.0.3/src/objscip/
H A Dobjconshdlr.cpp114 SCIP_CALL( conshdlrdata->objconshdlr->scip_init(scip, conshdlr, conss, nconss) ); in SCIP_DECL_CONSINIT()
131 SCIP_CALL( conshdlrdata->objconshdlr->scip_exit(scip, conshdlr, conss, nconss) ); in SCIP_DECL_CONSEXIT()
148 SCIP_CALL( conshdlrdata->objconshdlr->scip_initpre(scip, conshdlr, conss, nconss) ); in SCIP_DECL_CONSINITPRE()
165 SCIP_CALL( conshdlrdata->objconshdlr->scip_exitpre(scip, conshdlr, conss, nconss) ); in SCIP_DECL_CONSEXITPRE()
182 SCIP_CALL( conshdlrdata->objconshdlr->scip_initsol(scip, conshdlr, conss, nconss) ); in SCIP_DECL_CONSINITSOL()
199 SCIP_CALL( conshdlrdata->objconshdlr->scip_exitsol(scip, conshdlr, conss, nconss, restart) ); in SCIP_DECL_CONSEXITSOL()
250 SCIP_CALL( conshdlrdata->objconshdlr->scip_initlp(scip, conshdlr, conss, nconss, infeasible) ); in SCIP_DECL_CONSINITLP()
335 SCIP_CALL( conshdlrdata->objconshdlr->scip_enfops(scip, conshdlr, conss, nconss, nusefulconss, in SCIP_DECL_CONSENFOPS()
353 SCIP_CALL( conshdlrdata->objconshdlr->scip_check(scip, conshdlr, conss, nconss, sol, in SCIP_DECL_CONSCHECK()
388 …SCIP_CALL( conshdlrdata->objconshdlr->scip_presol(scip, conshdlr, conss, nconss, nrounds, presolti… in SCIP_DECL_CONSPRESOL()
[all …]
/dports/math/SCIP/scip-7.0.3/tests/src/cons/or/
H A Ddisable_upgrades.c71 int nconss; variable
78 nconss = SCIPgetNOrigConss(scip);
81 cr_assert_eq(nconss, 8);
84 for( i = 0; i < nconss; ++i )
/dports/math/SCIP/scip-7.0.3/src/nlpi/
H A Dnlpioracle.c469 oracle->nconss = 0; in freeConstraints()
1558 if( nconss == 0 ) in SCIPnlpiOracleAddConstraints()
1561 assert(nconss > 0); in SCIPnlpiOracleAddConstraints()
1567 SCIP_CALL( ensureConssSize(oracle, oracle->nconss + nconss) ); in SCIPnlpiOracleAddConstraints()
1568 for( c = 0; c < nconss; ++c ) in SCIPnlpiOracleAddConstraints()
1598 oracle->nconss += nconss; in SCIPnlpiOracleAddConstraints()
1698 for( i = 0; i < nconss; ++i ) in SCIPnlpiOracleChgConsSides()
1844 lastgood = oracle->nconss - 1; in SCIPnlpiOracleDelConsSet()
1899 oracle->nconss = lastgood+1; in SCIPnlpiOracleDelConsSet()
1923 assert(considx < oracle->nconss); in SCIPnlpiOracleChgLinearCoefs()
[all …]
/dports/math/py-or-tools/or-tools-9.2/ortools/linear_solver/
H A Dscip_callback.cc218 int nconss, int nusefulconss, SCIP_SOL* sol, in CallbackSetup()
225 absl::MakeSpan(conss, nconss).subspan(nusefulconss)) { in CallbackSetup()
257 operations_research::CallbackSetup setup(scip, conshdlr, conss, nconss, in SCIP_DECL_CONSENFOLP()
285 operations_research::CallbackSetup setup(scip, conshdlr, conss, nconss, in SCIP_DECL_CONSSEPALP()
313 operations_research::CallbackSetup setup(scip, conshdlr, conss, nconss, in SCIP_DECL_CONSSEPASOL()
343 operations_research::CallbackSetup setup(scip, conshdlr, conss, nconss, in SCIP_DECL_CONSCHECK()
344 nconss, sol, false); in SCIP_DECL_CONSCHECK()
362 operations_research::CallbackSetup setup(scip, conshdlr, conss, nconss, in SCIP_DECL_CONSENFOPS()
/dports/math/SCIP/scip-7.0.3/examples/Binpacking/src/
H A Dpricer_binpacking.c130 int nconss; in addBranchingDecisionConss() local
147 nconss = SCIPconshdlrGetNConss(conshdlr); in addBranchingDecisionConss()
152 for( c = 0; c < nconss; ++c ) in addBranchingDecisionConss()
607 int nconss; in SCIP_DECL_PRICERREDCOST() local
613 nconss = 0; in SCIP_DECL_PRICERREDCOST()
631 consids[nconss] = o; in SCIP_DECL_PRICERREDCOST()
632 nconss++; in SCIP_DECL_PRICERREDCOST()
640 SCIP_CALL( SCIPvardataCreateBinpacking(scip, &vardata, consids, nconss) ); in SCIP_DECL_PRICERREDCOST()
657 for( v = 0; v < nconss; ++v ) in SCIP_DECL_PRICERREDCOST()

123456