/dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/src/Algorithms/OaGenerators/ |
H A D | BonFpForMinlp.cpp | 92 const double * colsol = NULL; in performOa() local 111 colsol = subMip_->getLastSolution(); in performOa() 127 while (colsol) { in performOa() 134 branch_info.solution_ = colsol; in performOa() 138 assert(fabs(colsol[indices[i]] - floor(colsol[indices[i]] + 0.5)) < 1e-5); in performOa() 139 x_bar[i] = colsol[indices[i]]; in performOa() 204 colsol = NULL; in performOa() 220 colsol = subMip_->getLastSolution(); in performOa() 225 if(colsol) in performOa() 231 colsol = NULL; in performOa() [all …]
|
H A D | BonOACutGenerator2.cpp | 138 const double * colsol = in performOa() local 140 branch_info.solution_ = colsol; in performOa() 160 nlp_->getOuterApproximation(cs, nlpSol, 1, colsol, in performOa() 238 colsol = const_cast<double *> (subMip_->getLastSolution()); in performOa() 239 isInteger = (colsol != 0); in performOa() 247 nlp_->getColSolution(), colsol); in performOa()
|
H A D | BonOaDecBase.cpp | 263 const double *colsol = si.getColSolution(); in generateCuts() local 273 brInfo.solution_ = colsol; in generateCuts() 288 if(savedCuts_.rowCut(i).violated(colsol) > 0.){ in generateCuts() 418 const double * colsol = nlp.getColSolution(); in checkInteger() local 422 if (fabs(colsol[i]) - floor(colsol[i] + 0.5) > in checkInteger() 425 <<" is, "<<fabs(colsol[i] - floor(colsol[i] + 0.5))<<std::endl; in checkInteger()
|
H A D | BonOaFeasChecker.cpp | 58 double * colsol = const_cast<double *>(lp->getColSolution()); in performOa() local 59 branch_info.solution_ = colsol; in performOa() 78 colsol:NULL; in performOa()
|
/dports/math/clp/Clp-1.17.3/Clp/src/ |
H A D | Idiot.cpp | 85 colsol[i] = lower[i]; in cleanIteration() 457 double *rowsol, *colsol; in solve2() local 821 colsol, lower, upper, in solve2() 926 if (colsol[i] > upper[i] - 1.0e-7 || colsol[i] < lower[i] + 1.0e-7) in solve2() 1203 colsol, lower, upper, in solve2() 1289 delete[] colsol; in solve2() 1318 double *rowsol, *colsol; in crossOver() local 1386 colsol[i] = value; in crossOver() 1404 colsol[i] = value; in crossOver() 1975 dj[i] = -CoinMin(upper[i] - colsol[i], colsol[i] - lower[i]); in crossOver() [all …]
|
H A D | IdiSolve.cpp | 92 double value = colsol[i]; in objval() 247 double value2 = colsol[i]; 326 CoinMemcpyN(colsol, ncols, saveSol); 357 assert(colsol[i] < lower[i] + tolerance || colsol[i] > upper[i] - tolerance); 484 double value2 = colsol[i]; 544 colsol[i] = upper[i]; 545 value2 = colsol[i]; 730 colsol[i] += value; 732 colsol[i] = lower[i]; 734 colsol[i] = upper[i]; [all …]
|
H A D | Idiot.hpp | 248 int nrows, int ncols, double *rowsol, double *colsol, 263 IdiotResult objval(int nrows, int ncols, double *rowsol, double *colsol, 274 double *colsol, const double *lower, const double *upper,
|
/dports/math/ogdf/OGDF/src/coin/Clp/ |
H A D | Idiot.cpp | 84 colsol[i] = lower[i]; in cleanIteration() 447 double * rowsol, * colsol; in solve2() local 471 colsol = new double [ncols]; in solve2() 734 CoinMemcpyN(colsol, ncols, saveSol); in solve2() 1148 model_->setColSolution(colsol); in solve2() 1153 delete [] colsol; in solve2() 1182 double * rowsol, * colsol; in crossOver() local 1246 double value = colsol[i]; in crossOver() 1249 colsol[i] = value; in crossOver() 1267 colsol[i] = value; in crossOver() [all …]
|
H A D | IdiSolve.cpp | 92 double value = colsol[i]; in objval() 132 int nrows, int ncols, double * rowsol , double * colsol, in IdiSolve() argument 228 double value2 = colsol[i]; in IdiSolve() 305 CoinMemcpyN(colsol, ncols, saveSol); in IdiSolve() 353 CoinMemcpyN(colsol, ncols, history[0]); in IdiSolve() 364 CoinMemcpyN(colsol, ncols, history[0]); in IdiSolve() 674 colsol[i] += value; in IdiSolve() 911 double value = colsol[icol]; in IdiSolve() 1111 CoinMemcpyN(colsol, ncols, saveSol); in IdiSolve() 1121 CoinMemcpyN(saveSol, ncols, colsol); in IdiSolve() [all …]
|
/dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/src/Algorithms/QuadCuts/ |
H A D | BonOuterApprox.hpp | 65 double rowLower, double rowUpper, double colsol, 79 double rowLower, double rowUpper, double colsol, in cleanNnz() argument 95 lb += value * (colsol - colLower); in cleanNnz() 100 ub += value * (colsol - colLower); in cleanNnz() 105 lb += value * (colsol - colUpper); in cleanNnz() 110 ub += value * (colsol - colUpper); in cleanNnz()
|
H A D | next | 65 double rowLower, double rowUpper, double colsol, 79 double rowLower, double rowUpper, double colsol, 95 lb += value * (colsol - colLower); 100 ub += value * (colsol - colLower); 105 lb += value * (colsol - colUpper); 110 ub += value * (colsol - colUpper);
|
/dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/src/Interfaces/ |
H A D | BonTMINLP2OsiLP.hpp | 89 double rowLower, double rowUpper, double colsol, 121 double rowLower, double rowUpper, double colsol, in cleanNnz() argument 138 lb += value * (colsol - colLower); in cleanNnz() 143 ub += value * (colsol - colLower); in cleanNnz() 148 lb += value * (colsol - colUpper); in cleanNnz() 153 ub += value * (colsol - colUpper); in cleanNnz()
|
/dports/math/cgl/Cgl-releases-0.60.3/Cgl/src/CglGomory/ |
H A D | CglGomoryTest.cpp | 133 colsol[column]<<") "; in CglGomoryUnitTest() 189 colsol = colsol2; in CglGomoryUnitTest() 214 colsol[column]<<") "; in CglGomoryUnitTest() 350 colsol[column]<<") "; in CglGomoryUnitTest() 406 colsol = colsol2; in CglGomoryUnitTest() 431 colsol[column]<<") "; in CglGomoryUnitTest() 567 colsol[column]<<") "; in CglGomoryUnitTest() 620 colsol = colsol2; in CglGomoryUnitTest() 645 colsol[column]<<") "; in CglGomoryUnitTest() 778 colsol[column]<<") "; in CglGomoryUnitTest() [all …]
|
H A D | CglGomory.cpp | 723 double value = colsol[iColumn]; 1039 j,value,colsol[j],swap[j] ? 'Y' : 'N', 1052 iColumn,j,value,colsol[j]); 1116 <<" value "<<colsol[iColumn]<<std::endl; 1187 if (fabs(colsol[jColumn])>10.0) 1191 sum+=value*colsol[jColumn]; 1213 sum+=value*colsol[jColumn]; 1408 total += value*colsol[jColumn]; 1422 total += value*colsol[jColumn]; 1674 total += value*colsol[jColumn]; [all …]
|
H A D | CglGomory.hpp | 42 const double * colsol, 53 const double * colsol,
|
/dports/math/cgl/Cgl-releases-0.60.3/Cgl/src/CglFlowCover/ |
H A D | CglFlowCoverTest.cpp | 84 const double* colsol = siP->getColSolution(); in CglFlowCoverUnitTest() local 96 sum2 += colsol[column] * elements[k]; in CglFlowCoverUnitTest() 104 << ", sol = " << colsol[column] << ") "; in CglFlowCoverUnitTest() 123 const double* colsol = siP->getColSolution(); in CglFlowCoverUnitTest() local 135 sum2 += colsol[column] * elements[k]; in CglFlowCoverUnitTest() 143 << ", sol = " << colsol[column] << ") "; in CglFlowCoverUnitTest()
|
/dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/src/Algorithms/ |
H A D | BonSolverHelp.cpp | 60 const double * colsol = info.solution_; in fixIntegers() local 63 double value = colsol[i]; in fixIntegers() 181 const double * colsol, const double *otherSol) in isDifferentOnIntegers() argument 188 if (fabs(otherSol[colnum] - colsol[colnum]) > integer_tolerance) { in isDifferentOnIntegers() 198 if (fabs(otherSol[members[k]] - colsol[members[k]]) > integer_tolerance) { in isDifferentOnIntegers() 208 if (si.isInteger(i) && fabs(otherSol[i] - colsol[i])>integer_tolerance) in isDifferentOnIntegers()
|
/dports/math/cgl/Cgl-releases-0.60.3/Cgl/src/CglProbing/ |
H A D | CglProbingTest.cpp | 102 const double * colsol = siP->getColSolution(); in CglProbingUnitTest() local 114 sum2 += colsol[column]*elements[k]; in CglProbingUnitTest() 121 colsol[column]<<") "; in CglProbingUnitTest() 188 const double * colsol = siP->getColSolution(); in CglProbingUnitTest() local 200 sum2 += colsol[column]*elements[k]; in CglProbingUnitTest() 207 colsol[column]<<") "; in CglProbingUnitTest()
|
H A D | CglProbing.cpp | 2162 double away = fabs(0.5-(colsol[i]-floor(colsol[i]))); in gutsOfGenerateCuts() 2221 double away = fabs(0.5-(colsol[j]-floor(colsol[j]))); in gutsOfGenerateCuts() 2790 double solInt=colsol[j]; in gutsOfGenerateCuts() 3363 solval=colsol[j]; in probe() 4931 (sum-gap*colsol[j] in probe() 5879 delete [] colsol; in probe() 6032 colsol[i]=colLower[i]; in probeCliques() 6035 colsol[i]=colUpper[i]; in probeCliques() 6086 solval=colsol[j]; in probeCliques() 7600 delete [] colsol; in probeCliques() [all …]
|
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/convex/operators/ |
H A D | quadCuts.cpp | 92 *colsol = problem.X (), // current solution in quadCuts() local 111 xi = colsol [ind], in quadCuts() 126 for (int i = 0 ; i < numcols ; i++) std::cout << colsol [i] << ", "; in quadCuts() 148 xi = colsol [qi], in quadCuts() 149 xj = colsol [qj]; in quadCuts() 211 xi = colsol [ind], in quadCuts()
|
/dports/graphics/opencv/opencv-4.5.3/contrib/modules/shape/src/ |
H A D | sc_dis.cpp | 540 colsol[j] = imin; in hungarian() 544 colsol[j]=-1; in hungarian() 609 i0 = colsol[j1]; in hungarian() 620 i0 = colsol[j2]; in hungarian() 625 colsol[j1]=i; in hungarian() 681 if (colsol[collist[k]] < 0) in hungarian() 695 i = colsol[j1]; in hungarian() 707 if (colsol[j] < 0) in hungarian() 737 colsol[endofpath] = i; in hungarian() 770 … cv::DMatch singleMatch(colsol[i],i,costMatrix.at<float>(colsol[i],i));//queryIdx,trainIdx,distance in hungarian() [all …]
|
/dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/test/ |
H A D | InterfaceTest.cpp | 138 const double * colsol = si.getColSolution(); in testOptimAndSolutionQuery() local 139 if(!eq(colsol[0],( (1./2.) + 1/sqrt(5.0)))) in testOptimAndSolutionQuery() 140 std::cout<<"Error for y[1] : "<<fabs(colsol[0]-( (1./2.) + 1/sqrt(5.0)))<<std::endl; in testOptimAndSolutionQuery() 141 if(!eq(colsol[1],( (1./2.) + 1/(2.*sqrt(5.0))))) in testOptimAndSolutionQuery() 142 std::cout<<"Error for y[2] : "<<fabs(colsol[1]-( (1./2.) + 1/(2*sqrt(5.0))))<<std::endl; in testOptimAndSolutionQuery() 143 if(!eq(colsol[2],( (1./2.) + 1/sqrt(5.)))) in testOptimAndSolutionQuery() 144 std::cout<<"Error for x : "<<fabs(colsol[2]-( (1./2.) + 1/sqrt(5.0)))<<std::endl; in testOptimAndSolutionQuery()
|
/dports/math/ogdf/OGDF/include/coin/ |
H A D | Idiot.hpp | 219 int nrows, int ncols, double * rowsol , double * colsol, 234 IdiotResult objval(int nrows, int ncols, double * rowsol , double * colsol, 245 double * colsol, const double * lower, const double * upper,
|
/dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/experimental/Separable/ |
H A D | BonOuterDescription.cpp | 22 double rowLower, double rowUpper, double colsol, in cleanNnz() argument 38 lb += value * (colsol - colLower); in cleanNnz() 43 ub += value * (colsol - colLower); in cleanNnz() 48 lb += value * (colsol - colUpper); in cleanNnz() 53 ub += value * (colsol - colUpper); in cleanNnz()
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/include/ |
H A D | symphony.h | 256 int sym_get_col_solution PROTO((sym_environment *env, double *colsol)); 259 double *colsol, double *objval)); 274 int sym_set_col_solution PROTO((sym_environment *env, double * colsol));
|