| /dports/math/cgl/Cgl-releases-0.60.3/Cgl/src/ |
| H A D | CglStored.hpp | 57 void addCut(const OsiCuts &cs);
59 void addCut(const OsiRowCut &cut);
61 void addCut(double lb, double ub, const CoinPackedVector &vector);
63 void addCut(double lb, double ub, int size, const int *colIndices, const double *elements);
|
| H A D | CglStored.cpp | 197 void CglStored::addCut(const OsiCuts &cs) in addCut() function in CglStored
205 void CglStored::addCut(const OsiRowCut &cut) in addCut() function in CglStored
210 void CglStored::addCut(double lb, double ub, const CoinPackedVector &vector) in addCut() function in CglStored
220 void CglStored::addCut(double lb, double ub, int size, const int *colIndices, const double *element… in addCut() function in CglStored
|
| H A D | CglTreeInfo.cpp | 1173 stored->addCut(-COIN_DBL_MAX,rhs,n,whichP,element); in analyze()
|
| /dports/math/SCIP/scip-7.0.3/src/scip/ |
| H A D | sepa_impliedbounds.c | 71 SCIP_RETCODE addCut( in addCut() function
212 …SCIP_CALL( addCut(scip, sepa, 1.0, implvars[j], solval, (ub - implbounds[j]), fracvars[i], fracval… in separateCuts()
230 …SCIP_CALL( addCut(scip, sepa, -1.0, implvars[j], solval, (implbounds[j] - lb), fracvars[i], fracva… in separateCuts()
271 …SCIP_CALL( addCut(scip, sepa, 1.0, implvars[j], solval, (implbounds[j] - ub), fracvars[i], fracval… in separateCuts()
289 …SCIP_CALL( addCut(scip, sepa, -1.0, implvars[j], solval, (lb - implbounds[j]), fracvars[i], fracva… in separateCuts()
348 SCIP_CALL( addCut(scip, sepa, in separateCuts()
|
| H A D | sepa_aggregation.c | 178 SCIP_RETCODE addCut( in addCut() function
894 …SCIP_CALL( addCut(scip, sol, sepadata->cmir, FALSE, cutcoefs, cutinds, cutnnz, cutrhs, cutefficacy… in aggregation()
899 …SCIP_CALL( addCut(scip, sol, sepadata->flowcover, FALSE, cutcoefs, cutinds, cutnnz, cutrhs, cuteff… in aggregation()
|
| H A D | cons_logicor.c | 1612 SCIP_RETCODE addCut( in addCut() function
1712 SCIP_CALL( addCut(scip, cons, cutoff) ); in separateCons()
4170 SCIP_CALL( addCut(scip, conss[c], infeasible) ); in SCIP_DECL_CONSINITLP()
|
| H A D | sepa_mcf.c | 5780 SCIP_RETCODE addCut( in addCut() function
6413 …SCIP_CALL( addCut(scip, sepa, sepadata, sol, cutcoefs, cutrhs, cutinds, cutnnz, cutislocal, cutran… in generateClusterCuts()
6587 …SCIP_CALL( addCut(scip, sepa, sepadata, sol, cutcoefs, cutrhs, cutinds, cutnnz, cutislocal, cutran… in generateClusterCuts()
|
| H A D | cons_setppc.c | 2431 SCIP_RETCODE addCut( in addCut() function
2540 SCIP_CALL( addCut(scip, cons, cutoff) ); in separateCons()
7431 SCIP_CALL( addCut(scip, conss[c], infeasible) ); in SCIP_DECL_CONSINITLP()
|
| /dports/math/cvc4/CVC4-1.7/src/theory/arith/ |
| H A D | cut_log.h | 196 void addCut(CutInfo* ci);
279 void addCut();
|
| H A D | cut_log.cpp | 537 void NodeLog::addCut(CutInfo* ci){ in addCut() function in CVC4::theory::arith::NodeLog
602 void TreeLog::addCut(){ d_numCuts++; } in addCut() function in CVC4::theory::arith::TreeLog
|
| H A D | approx_simplex.cpp | 1489 node.addCut(rd); in glpkCallback()
1511 node.addCut(gmi); in glpkCallback()
1517 node.addCut(mir); in glpkCallback()
1572 node.addCut(cut_br); in glpkCallback()
1578 node.addCut(cut_br); in glpkCallback()
1606 tl.addCut(); in glpkCallback()
|
| /dports/math/highs/HiGHS-cfe064e/src/mip/ |
| H A D | HighsCutPool.h | 107 int addCut(int* Rindex, double* Rvalue, int Rlen, double rhs,
|
| H A D | HighsSeparation.cpp | 962 int cut = cutpool.addCut(inds, vals, 1, 0.0); in separateImplBounds()
1004 int cut = cutpool.addCut(inds, vals, 2, rhs); in separateImplBounds()
1017 int cut = cutpool.addCut(inds, vals, 1, -1.0); in separateImplBounds()
1058 int cut = cutpool.addCut(inds, vals, 2, rhs); in separateImplBounds()
1761 int cutindex = cutpool.addCut(inds.data(), vals.data(), inds.size(), in computeCut()
2234 cutpool.addCut(inds.data(), vals.data(), inds.size(), upper, cutintegral); in retransformAndAddCut()
2406 int cutind = mipsolver.mipdata_->cutpool.addCut( in computeAndAddConflictCut()
|
| H A D | HighsCutPool.cpp | 286 int HighsCutPool::addCut(int* Rindex, double* Rvalue, int Rlen, double rhs, in addCut() function in HighsCutPool
|
| H A D | HighsCliqueTable.cpp | 902 int cut = cutpool.addCut(inds.data(), vals.data(), inds.size(), rhs); in separateCliques()
|
| /dports/math/cbc/Cbc-releases-2.10.5/Cbc/examples/ |
| H A D | qmip2.cpp | 156 stored.addCut(-COIN_DBL_MAX, 1.0, 3, cutIndices, cutEls); in main()
|
| H A D | allCuts.cpp | 334 stored.addCut(rowLower[iRow], rowUpper[iRow], rowLength[iRow], in main()
|
| H A D | sudoku.cpp | 352 stored.addCut(-COIN_DBL_MAX, 1.0, 2, cutInd, values); in main()
|
| /dports/graphics/blender/blender-2.91.0/release/scripts/addons/curve_tools/ |
| H A D | internal.py | 373 def addCut(paramA, paramB): function
384 addCut(intersection[0], intersection[1])
411 addCut(solution[0], solution[1])
|
| /dports/math/cbc/Cbc-releases-2.10.5/Cbc/src/ |
| H A D | CbcSolverExpandKnapsack.cpp | 492 stored.addCut(rowLower[jRow], rowUpper[jRow], in expandKnapsack()
|
| H A D | CbcLinked.cpp | 261 gen2->addCut(-COIN_DBL_MAX, offset + 1.0e-7, n, column, gradient); in initialSolve()
520 gen2->addCut(-COIN_DBL_MAX, offset + 1.0e-4, n, column, gradient); in resolve()
776 gen2->addCut(-COIN_DBL_MAX, offset + 1.0e-7, n, column, gradient); in resolve()
778 gen2->addCut(offset - 1.0e-7, COIN_DBL_MAX, n, column, gradient); in resolve()
851 cutGen->addCut(-COIN_DBL_MAX, offset + 1.0e-7, n, column, gradient); in doAOCuts()
2643 cut->addCut(-COIN_DBL_MAX, offset + 1.0e-7, n, column, gradient); in linearizedBAB()
|
| H A D | CbcSolver.cpp | 1567 storedAmpl.addCut(rowLower[iRow], rowUpper[iRow], in CbcMain1()
1624 storedAmpl.addCut(rowLower[iRow], rowUpper[iRow], in CbcMain1()
3717 storedAmpl.addCut(-COIN_DBL_MAX, offset + 1.0e-7, n, column, gradient); in CbcMain1()
6655 newCuts.addCut(lb, ub, n, buildColumn, element); in CbcMain1()
6966 sosCuts.addCut(0.0, rhs, in CbcMain1()
|
| /dports/math/cgl/Cgl-releases-0.60.3/Cgl/src/CglDuplicateRow/ |
| H A D | CglDuplicateRow.cpp | 406 storedCuts_->addCut(0.0,COIN_DBL_MAX,2,inds,els); in generateCuts12()
|
| /dports/cad/gmsh/gmsh-4.9.2-source/Mesh/ |
| H A D | gmshCrossFields.cpp | 1952 static bool addCut(const SPoint3 &p, const MEdge &e, int COUNT, int ID, in addCut() function
1987 bool added = addCut(p, e, COUNT, NB, cuts); in computeOneIsoRecur()
|
| /dports/math/cgl/Cgl-releases-0.60.3/Cgl/src/CglPreProcess/ |
| H A D | CglPreProcess.cpp | 2888 stored.addCut(rowLower[iRow], rowUpper[iRow], rowLength[iRow], in preProcessNonDefault()
|