| /dports/science/pagmo2/pagmo2-2.18.0/src/algorithms/ |
| H A D | bee_colony.cpp | 128 newsol = X[i]; in evolve()
137 newsol[comp2change] += phirng(m_e) * (newsol[comp2change] - X[rdv][comp2change]); in evolve()
140 newsol[comp2change] = lb[comp2change]; in evolve()
143 newsol[comp2change] = ub[comp2change]; in evolve()
146 auto newfitness = prob.fitness(newsol); in evolve()
150 pop.set_xf(i, newsol, newfitness); in evolve()
188 newsol = X[s]; in evolve()
197 newsol[comp2change] += phirng(m_e) * (newsol[comp2change] - X[rdv][comp2change]); in evolve()
200 newsol[comp2change] = lb[comp2change]; in evolve()
206 auto newfitness = prob.fitness(newsol); in evolve()
[all …]
|
| /dports/math/SCIP/scip-7.0.3/applications/CycleClustering/src/ |
| H A D | event_newsol.c | 79 SCIP_SOL* newsol; in SCIP_DECL_EVENTEXEC() local
92 newsol = SCIPeventGetSol(event); in SCIP_DECL_EVENTEXEC()
93 assert(newsol != NULL); in SCIP_DECL_EVENTEXEC()
95 …ip, "catch event for solution %p with obj=%g.\n", (void*) newsol, SCIPgetSolOrigObj(scip, newsol)); in SCIP_DECL_EVENTEXEC()
97 SCIP_CALL( addCandSolCyckerlin(scip, newsol) ); in SCIP_DECL_EVENTEXEC()
|
| H A D | heur_redsize.c | 62 SCIP_SOL* newsol; in SCIPcycAddIncompleteSol() local
75 SCIP_CALL( SCIPcreateSol(scip, &newsol, heur) ); in SCIPcycAddIncompleteSol()
87 SCIP_CALL( assignVars(scip, newsol, solclustering, nbins, ncluster) ); in SCIPcycAddIncompleteSol()
89 SCIP_CALL( SCIPtrySolFree(scip, &newsol, FALSE, TRUE, TRUE, TRUE, TRUE, &feasible) ); in SCIPcycAddIncompleteSol()
|
| /dports/math/SCIP/scip-7.0.3/src/scip/ |
| H A D | cons_benders.c | 90 SCIP_SOL* newsol; in constructValidSolution() local
114 SCIP_CALL( SCIPcreateSolCopy(scip, &newsol, sol) ); in constructValidSolution()
121 SCIP_CALL( SCIPcreateLPSol(scip, &newsol, NULL) ); in constructValidSolution()
124 SCIP_CALL( SCIPcreatePseudoSol(scip, &newsol, NULL) ); in constructValidSolution()
127 SCIP_CALL( SCIPcreateRelaxSol(scip, &newsol, NULL) ); in constructValidSolution()
130 SCIP_CALL( SCIPcreateLPSol(scip, &newsol, NULL) ); in constructValidSolution()
134 SCIP_CALL( SCIPunlinkSol(scip, newsol) ); in constructValidSolution()
158 SCIP_CALL( SCIPsetSolVal(scip, newsol, auxiliaryvars[j], objval) ); in constructValidSolution()
182 conshdlrdata->checkedsols[conshdlrdata->ncheckedsols] = SCIPsolGetIndex(newsol); in constructValidSolution()
192 SCIP_CALL( SCIPheurPassSolAddSol(scip, heurtrysol, newsol) ); in constructValidSolution()
[all …]
|
| H A D | heur_bound.c | 227 SCIP_SOL* newsol; in applyBoundHeur() local
232 SCIP_CALL( SCIPcreateSol(scip, &newsol, heur) ); in applyBoundHeur()
235 SCIP_CALL( SCIPlinkLPSol(scip, newsol) ); in applyBoundHeur()
237 SCIP_CALL( SCIProundSol(scip, newsol, &success) ); in applyBoundHeur()
242 SCIPgetSolOrigObj(scip, newsol)); in applyBoundHeur()
249 SCIP_CALL( SCIPtrySol(scip, newsol, TRUE, TRUE, TRUE, TRUE, TRUE, &stored) ); in applyBoundHeur()
251 SCIP_CALL( SCIPtrySol(scip, newsol, FALSE, FALSE, TRUE, FALSE, FALSE, &stored) ); in applyBoundHeur()
262 SCIP_CALL( SCIPfreeSol(scip, &newsol) ); in applyBoundHeur()
|
| H A D | heur_reoptsols.c | 87 SCIP_SOL* newsol; /* solution to be created for the original problem */ in createNewSol() local
100 SCIP_CALL( SCIPcreateSol(scip, &newsol, heur) ); in createNewSol()
101 SCIP_CALL( SCIPsetSolVals(scip, newsol, nvars, vars, solvals) ); in createNewSol()
104 SCIP_CALL( SCIPtrySolFree(scip, &newsol, FALSE, FALSE, TRUE, TRUE, TRUE, success) ); in createNewSol()
|
| H A D | heur_padm.c | 595 SCIP_SOL* newsol; in reuseSolution() local
623 SCIP_CALL( SCIPcreateOrigSol(subscip, &newsol, NULL) ); in reuseSolution()
624 SCIP_CALL( SCIPsetSolVals(subscip, newsol, nvars, blockvars, blockvals) ); in reuseSolution()
647 SCIP_CALL( SCIPsetSolVal(subscip, newsol, block->slacksneg[c], 0.0) ); in reuseSolution()
653 SCIP_CALL( SCIPsetSolVal(subscip, newsol, block->slackspos[c], 0.0) ); in reuseSolution()
658 SCIP_CALL( SCIPsetSolVal(subscip, newsol, block->slackspos[c], 0.0) ); in reuseSolution()
659 SCIP_CALL( SCIPsetSolVal(subscip, newsol, block->slacksneg[c], 0.0) ); in reuseSolution()
664 SCIP_CALL( SCIPaddSolFree(subscip, &newsol, &success) ); in reuseSolution()
1629 SCIP_SOL* newsol; in SCIP_DECL_HEUREXEC() local
1635 SCIP_CALL( SCIPcreateSol(scip, &newsol, heur) ); in SCIP_DECL_HEUREXEC()
[all …]
|
| H A D | heur_proximity.c | 232 SCIP_SOL* newsol; /* solution to be created for the original problem */ in createNewSol() local
256 SCIP_CALL( SCIPcreateSol(scip, &newsol, heur) ); in createNewSol()
257 SCIP_CALL( SCIPsetSolVals(scip, newsol, nvars, vars, subsolvals) ); in createNewSol()
287 … SCIPstatisticMessage("Solution Value before LP resolve: %g\n", SCIPgetSolOrigObj(scip, newsol)); in createNewSol()
288 SCIP_CALL( solveLp(scip, newsol, success) ); in createNewSol()
295 SCIP_CALL( SCIPsetSolVal(scip, newsol, vars[v], subsolvals[v]) ); in createNewSol()
303 SCIP_CALL( SCIPtrySol(scip, newsol, FALSE, FALSE, TRUE, TRUE, TRUE, success) ); in createNewSol()
305 SCIP_CALL( SCIPfreeSol(scip, &newsol) ); in createNewSol()
|
| H A D | scip_copy.c | 1373 assert(newsol != NULL); in SCIPtranslateSubSol()
1383 SCIP_CALL( SCIPcreateSol(scip, newsol, heur) ); in SCIPtranslateSubSol()
1405 SCIP_SOL* newsol = NULL; in SCIPtranslateSubSols() local
1440 if( newsol == NULL ) in SCIPtranslateSubSols()
1442 SCIP_CALL( SCIPcreateSol(scip, &newsol, heur) ); in SCIPtranslateSubSols()
1444 *solindex = SCIPsolGetIndex(newsol); in SCIPtranslateSubSols()
1449 SCIP_CALL( SCIPsetSolVals(scip, newsol, nvars, vars, solvals) ); in SCIPtranslateSubSols()
1458 SCIP_CALL( SCIPaddSolFree(scip, &newsol, success) ); in SCIPtranslateSubSols()
1469 assert(newsol == NULL); in SCIPtranslateSubSols()
1476 if( newsol != NULL ) in SCIPtranslateSubSols()
[all …]
|
| H A D | heur_completesol.c | 896 SCIP_SOL* newsol; in setupAndSolve() local
899 SCIP_CALL( SCIPtranslateSubSol(scip, subscip, subsols[i], heur, subvars, &newsol) ); in setupAndSolve()
900 SCIP_CALL( SCIPtrySolFree(scip, &newsol, FALSE, FALSE, TRUE, TRUE, TRUE, &success) ); in setupAndSolve()
1178 SCIP_SOL* newsol; in SCIP_DECL_HEUREXEC() local
1184 SCIP_CALL( SCIPcreateSol(scip, &newsol, heur) ); in SCIP_DECL_HEUREXEC()
1191 SCIP_CALL( SCIPsetSolVal(scip, newsol, vars[v], solval) ); in SCIP_DECL_HEUREXEC()
1194 SCIP_CALL( SCIPtrySolFree(scip, &newsol, FALSE, FALSE, TRUE, TRUE, TRUE, &stored) ); in SCIP_DECL_HEUREXEC()
|
| H A D | concsolver_scip.c | 676 SCIP_SOL* newsol; in SCIP_DECL_CONCSOLVERSYNCREAD() local
684 SCIP_CALL( SCIPcreateOrigSol(data->solverscip, &newsol, NULL) ); in SCIP_DECL_CONCSOLVERSYNCREAD()
686 SCIP_CALL( SCIPsetSolVals(data->solverscip, newsol, data->nvars, data->vars, solvals[i]) ); in SCIP_DECL_CONCSOLVERSYNCREAD()
688 SCIP_CALL( SCIPaddConcurrentSol(data->solverscip, newsol) ); in SCIP_DECL_CONCSOLVERSYNCREAD()
|
| H A D | heur_zeroobj.c | 480 SCIP_SOL* newsol; in setupAndSolveSubscip() local
482 SCIP_CALL( SCIPtranslateSubSol(scip, subscip, subsols[i], heur, subvars, &newsol) ); in setupAndSolveSubscip()
484 SCIP_CALL( SCIPtrySolFree(scip, &newsol, FALSE, FALSE, TRUE, TRUE, TRUE, &success) ); in setupAndSolveSubscip()
|
| H A D | heur_ofins.c | 355 SCIP_SOL* newsol; in setupAndSolve() local
357 SCIP_CALL( SCIPtranslateSubSol(scip, subscip, subsols[i], heur, subvars, &newsol) ); in setupAndSolve()
360 SCIP_CALL( SCIPtrySolFree(scip, &newsol, FALSE, FALSE, TRUE, TRUE, TRUE, &success) ); in setupAndSolve()
|
| /dports/math/SCIP/scip-7.0.3/examples/TSP/src/ |
| H A D | HeurFrats.cpp | 99 SCIP_SOL* newsol; in SCIP_DECL_HEUREXEC() local
130 SCIP_CALL( SCIPcreateSol (scip, &newsol, heur) ); in SCIP_DECL_HEUREXEC()
200 SCIP_CALL( SCIPsetSolVal(scip, newsol, bestedge->var, 1.0) ); in SCIP_DECL_HEUREXEC()
218 SCIP_CALL( SCIPtrySol(scip, newsol, FALSE, FALSE, FALSE, FALSE, FALSE, &success) ); in SCIP_DECL_HEUREXEC()
223 SCIP_CALL( SCIPfreeSol(scip, &newsol) ); in SCIP_DECL_HEUREXEC()
|
| H A D | Heur2opt.cpp | 122 bool newsol; in SCIP_DECL_HEUREXEC() local
129 newsol = true; in SCIP_DECL_HEUREXEC()
132 newsol = false; in SCIP_DECL_HEUREXEC()
150 if( newsol ) in SCIP_DECL_HEUREXEC()
|
| /dports/math/SCIP/scip-7.0.3/src/tclique/ |
| H A D | tclique_branch.c | 431 TCLIQUE_NEWSOL((*newsol)), /**< user function to call on every new solution */ in newSolution() argument
457 assert(newsol == NULL || cliquehash != NULL); in newSolution()
464 if( newsol != NULL ) in newSolution()
481 if( newsol != NULL ) in newSolution()
484 …newsol(tcliquedata, curcliquenodes, ncurcliquenodes, curcliqueweight, maxcliqueweight, &acceptsol,… in newSolution()
715 TCLIQUE_NEWSOL((*newsol)), /**< user function to call on every new solution */ in branch() argument
971 … newSolution(selectadjnodes, tcliquegraph, newsol, tcliquedata, cliquehash, buffer, Vzero, nVzero, in branch()
1007 TCLIQUE_NEWSOL((*newsol)), /**< user function to call on every new solution */ in tcliqueMaxClique() argument
1069 if( newsol != NULL ) in tcliqueMaxClique()
1112 …backtracklevel = branch(getnnodes, getweights, isedge, selectadjnodes, tcliquegraph, newsol, tcliq… in tcliqueMaxClique()
[all …]
|
| /dports/math/gambit/gambit-16.0.1/library/src/lcp/ |
| H A D | efglcp.cc | 187 bool newsol = false; in AllLemke() local
188 for (int i = B.MinRow(); i <= B.MaxRow() && !newsol; i++) { in AllLemke()
204 newsol = false; in AllLemke()
207 newsol = p_solution.AddBFS(BCopy); in AllLemke()
213 if (newsol) { in AllLemke()
226 if (newsol) { in AllLemke()
|
| /dports/math/libmesh/libmesh-1.6.2/src/error_estimation/ |
| H A D | jump_error_estimator.C | 137 NumericVector<Number> * newsol = in estimate_error() local
140 newsol->swap(*sys.solution); in estimate_error()
420 NumericVector<Number> * newsol = in estimate_error() local
423 newsol->swap(*sys.solution); in estimate_error()
|
| H A D | exact_error_estimator.C | 217 NumericVector<Number> * newsol = in estimate_error() local
220 newsol->swap(*sys.solution); in estimate_error()
392 NumericVector<Number> * newsol = in estimate_error() local
395 newsol->swap(*sys.solution); in estimate_error()
|
| /dports/cad/opencascade/opencascade-7.6.0/src/TopOpeBRepBuild/ |
| H A D | TopOpeBRepBuild_KPart.cxx | 665 TopoDS_Solid newsol; in MergeKPartiskoletge() local
667 myBuildTool.MakeSolid(newsol); in MergeKPartiskoletge()
672 if ( !newsol.IsNull() ) { in MergeKPartiskoletge()
673 lmergesha1.Append(newsol); in MergeKPartiskoletge()
798 lmergesha1.Append(newsol); in MergeKPartisdisj()
1922 TopoDS_Solid newsol; in BuildNewSolid() local
1923 aBuildTool.MakeSolid(newsol); in BuildNewSolid()
2009 return newsol; in BuildNewSolid()
2083 acurrentsolid = newsol; in disjPerformFuse()
2161 aMapOfCommonOfCouple.Add(newsol); in disjPerformCommon()
[all …]
|
| H A D | TopOpeBRepBuild_kpkole.cxx | 360 TopoDS_Solid newsol; in MergeKPartiskole() local
362 myBuildTool.MakeSolid(newsol); in MergeKPartiskole()
363 myBuildTool.AddSolidShell(newsol,newshe); in MergeKPartiskole()
387 myBuildTool.AddSolidShell(newsol,shecur); in MergeKPartiskole()
412 myBuildTool.AddSolidShell(newsol,shecur); in MergeKPartiskole()
417 if ( !newsol.IsNull() ) { in MergeKPartiskole()
418 lmergesha1.Append(newsol); in MergeKPartiskole()
|
| /dports/math/py-Diofant/Diofant-0.13.0/diofant/simplify/ |
| H A D | ratsimp.py | 196 newsol = []
201 newsol.append((c_hat.subs(sol), d_hat.subs(sol)))
202 c, d = min(newsol, key=lambda x: len(x[0].terms()) + len(x[1].terms()))
|
| /dports/math/py-sympy/sympy-1.9/sympy/simplify/ |
| H A D | ratsimp.py | 208 newsol = []
211 newsol.append((c_hat.subs(sol), d_hat.subs(sol)))
212 c, d = min(newsol, key=lambda x: len(x[0].terms()) + len(x[1].terms()))
|
| /dports/science/InsightToolkit/ITK-5.0.1/Modules/Numerics/FEM/include/ |
| H A D | itkFEMSolverCrankNicolson.hxx | 824 Float newsol = t * ( temp ) + ( 1. - t ) * temp2; in AverageLastTwoDisplacements() local
825 this->m_LinearSystem->SetSolutionValue(i, newsol, m_SolutionTMinus1Index); in AverageLastTwoDisplacements()
826 this->m_LinearSystem->SetVectorValue(i, newsol, m_SolutionVectorTMinus1Index); in AverageLastTwoDisplacements()
827 this->m_LinearSystem->SetSolutionValue(i, newsol, m_SolutionTIndex); in AverageLastTwoDisplacements()
828 if( newsol > maxs ) in AverageLastTwoDisplacements()
830 maxs = newsol; in AverageLastTwoDisplacements()
|
| /dports/science/getdp/getdp-3.4.0-source/Kernel/ |
| H A D | EigenSolve_ARPACK.cpp | 225 int n, j, k, l, newsol, quad_evp = 0; in EigenSolve_ARPACK() local
688 newsol = 0; in EigenSolve_ARPACK()
745 if(newsol) { in EigenSolve_ARPACK()
753 newsol = 1; in EigenSolve_ARPACK()
|