/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/branch/ |
H A D | BranchCore.cpp | 74 if (problem_ -> bestSol ()) { in branchCore() 76 if ((solver -> getColUpper () [indVar] > problem_ -> bestSol () [indVar]) && in branchCore() 77 (brpt < problem_ -> bestSol () [indVar])) in branchCore() 164 if (problem_ -> bestSol () && in branchCore() 165 (solver -> getColLower () [*it] < problem_ -> bestSol () [*it]) && in branchCore() 170 if (problem_ -> bestSol ()) { in branchCore() 222 problem_ -> bestSol () ? problem_ -> bestSol () [indVar] : 0.); in branchCore() 224 if (problem_ -> bestSol ()) { in branchCore() 234 (solver -> getColUpper () [i] < problem_ -> bestSol () [i] - COUENNE_EPS)) in branchCore() 255 problem_ -> bestSol () ? problem_ -> bestSol () [indVar] : 0.); in branchCore() [all …]
|
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/bound_tightening/twoImpliedBT/ |
H A D | TwoImpliedGenCuts.cpp | 698 if (problem_ -> bestSol () && in generateCuts() 699 problem_ -> bestSol () [i] > oldLB [i] && in generateCuts() 700 problem_ -> bestSol () [i] < clb [i] - 1e-12) { in generateCuts() 704 i, oldLB [i], clb [i], problem_ -> bestSol () [i], clb [i] - problem_ -> bestSol () [i]); in generateCuts() 715 if (problem_ -> bestSol () && in generateCuts() 716 problem_ -> bestSol () [i] < oldUB [i] && in generateCuts() 717 problem_ -> bestSol () [i] > cub [i] + 1e-12) { in generateCuts() 721 i, oldUB [i], cub [i], problem_ -> bestSol () [i], problem_ -> bestSol () [i] - cub [i]); in generateCuts()
|
H A D | TwoImpliedIneqCombine.cpp | 692 if (p -> bestSol () && in combine() 693 ((p -> bestSol () [indVar] > newU + COUENNE_EPS) || in combine() 694 (p -> bestSol () [indVar] < newL - COUENNE_EPS)) && in combine() 695 (p -> bestSol () [indVar] >= clbi) && in combine() 696 (p -> bestSol () [indVar] <= cubi)) in combine() 698 printf ("optimum violated: %g not in [%g,%g]\n", p -> bestSol () [indVar], newL, newU); in combine()
|
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-outlier/src/main/java/de/lmu/ifi/dbs/elki/algorithm/outlier/subspace/ |
H A D | AggarwalYuEvolutionary.java | 222 TopBoundedHeap<Individuum> bestSol = new TopBoundedHeap<>(m, Collections.reverseOrder()); in run() local 224 bestSol.add(ind); in run() 239 … for(Heap<Individuum>.UnorderedIter it = bestSol.unorderedIter(); it.valid(); it.advance()) { in run() 244 bestSol.add(ind); in run() 248 … for(Heap<Individuum>.UnorderedIter it = bestSol.unorderedIter(); it.valid(); it.advance()) { in run() 267 return bestSol.unorderedIter(); in run()
|
/dports/math/ogdf/OGDF/src/coin/Clp/ |
H A D | IdiSolve.cpp | 178 double bestSol = 1.0e60; in IdiSolve() local 771 if (result.weighted < bestSol) { in IdiSolve() 773 result.weighted * maxmin - useOffset, bestSol * maxmin - useOffset)); in IdiSolve() 774 bestSol = result.weighted; in IdiSolve() 1109 if (result.weighted < bestSol) { in IdiSolve() 1110 bestSol = result.weighted; in IdiSolve() 1114 result.weighted * maxmin - useOffset, bestSol * maxmin - useOffset)); in IdiSolve()
|
/dports/biology/abyss/abyss-2.3.1/SimpleGraph/ |
H A D | SimpleGraph.cpp | 568 ContigPaths::iterator bestSol = solutions.end(); in handleEstimate() local 592 bestSol = solIter; in handleEstimate() 633 assert(bestSol != solutions.end()); in handleEstimate() 634 ContigPath& path = *bestSol; in handleEstimate()
|
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/bound_tightening/ |
H A D | BTPerfIndicator.cpp | 39 CouNumber *optimum = problem_ -> bestSol (); in update()
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/NOMAD/examples/interfaces/Matlab_MEX/Source/ |
H A D | nomadmex.cpp | 1079 const NOMAD::Eval_Point *bestSol = mads->get_best_feasible(); in mexFunction() local 1080 if(bestSol == NULL) in mexFunction() 1082 bestSol = mads->get_best_infeasible(); in mexFunction() 1086 if(bestSol == NULL) in mexFunction() 1092 NOMAD::Point pt(*bestSol); in mexFunction() 1096 *fval = bestSol->get_f().value(); in mexFunction()
|
/dports/math/clp/Clp-1.17.3/Clp/src/ |
H A D | IdiSolve.cpp | 180 double bestSol = 1.0e60; local 828 if (result.weighted < bestSol) { 830 result.weighted * maxmin - useOffset, bestSol * maxmin - useOffset)); 831 bestSol = result.weighted; 1222 if (result.weighted < bestSol) { 1223 bestSol = result.weighted; 1227 result.weighted * maxmin - useOffset, bestSol * maxmin - useOffset));
|
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/cut/sdpcuts/ |
H A D | CutGen.cpp | 574 if (problem_ -> bestSol () && ((violation = cut -> violated (problem_ -> bestSol ())) > 0.)) { in genSDPcut()
|
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/convex/ |
H A D | createCuts.cpp | 104 CouNumber *best = problem_ -> bestSol (); in createCut()
|
H A D | generateCuts.cpp | 155 *&realOpt = problem_ -> bestSol (), in generateCuts()
|
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/convex/operators/ |
H A D | quadCuts.cpp | 251 *optimum = cg -> Problem () -> bestSol (), in quadCuts()
|
H A D | conv-exprTrilinear-gencuts.cpp | 1312 if (cg -> Problem () -> bestSol ()) { in generateCuts() 1317 double *sol = cg -> Problem () -> bestSol (); in generateCuts()
|
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/problem/ |
H A D | CouenneProblem.hpp | 451 CouNumber *&bestSol () const {return optimum_;} ///< Best known solution (read from file) in bestSol() function in Couenne::CouenneProblem
|