Home
last modified time | relevance | path

Searched refs:numberToDo (Results 1 – 25 of 40) sorted by relevance

12

/dports/math/cbc/Cbc-releases-2.10.5/Cbc/src/
H A DCbcNode.cpp2011 int numberToDo = 0; in chooseDynamicBranch() local
2064 numberToDo = 0; in chooseDynamicBranch()
2221 numberToDo = 0; in chooseDynamicBranch()
2726 numberToDo = CoinMin(numberToDo, 1); in chooseDynamicBranch()
2728 numberToDo = CoinMin(numberToDo, 20); in chooseDynamicBranch()
2785 numberToDo = 1; in chooseDynamicBranch()
2822 numberToDo = 0; in chooseDynamicBranch()
2958 numberToDo = 0; in chooseDynamicBranch()
4517 int numberToDo = 0; in analyze() local
4559 numberToDo = 0; in analyze()
[all …]
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/branch/
H A DdoStrongBranching.cpp71 int numberToDo, int returnCriterion) { in doStrongBranching() argument
88 "\n-\n------- CCS: trying %d objects:\n", numberToDo); in doStrongBranching()
137 for (iDo = 0; iDo < numberToDo; iDo++) { in doStrongBranching()
414 if (iDo < numberToDo) iDo++; // exited due to infeasibility in doStrongBranching()
H A DCouenneChooseStrong.hpp62 int numberToDo, int returnCriterion);
/dports/math/ogdf/OGDF/src/coin/Osi/
H A DOsiChooseVariable.cpp369 int numberToDo, int returnCriterion) in doStrongBranching() argument
384 for (int iDo=0;iDo<numberToDo;iDo++) { in doStrongBranching()
919 int numberToDo=0; in chooseVariable() local
930 results_[numberToDo++] = OsiHotInfo(solver, info, in chooseVariable()
945 if (numberToDo) { in chooseVariable()
946 returnCode = doStrongBranching(solver, info, numberToDo, 1); in chooseVariable()
/dports/math/osi/Osi-0.108.6/Osi/src/Osi/
H A DOsiChooseVariable.cpp360 int numberToDo, int returnCriterion) in doStrongBranching() argument
375 for (int iDo = 0; iDo < numberToDo; iDo++) { in doStrongBranching()
904 int numberToDo = 0; in chooseVariable() local
915 results_[numberToDo++] = OsiHotInfo(solver, info, in chooseVariable()
930 if (numberToDo) { in chooseVariable()
931 returnCode = doStrongBranching(solver, info, numberToDo, 1); in chooseVariable()
H A DOsiChooseVariable.hpp473 int numberToDo, int returnCriterion);
/dports/math/clp/Clp-1.17.3/Osi/src/Osi/
H A DOsiChooseVariable.cpp360 int numberToDo, int returnCriterion) in doStrongBranching() argument
375 for (int iDo = 0; iDo < numberToDo; iDo++) { in doStrongBranching()
904 int numberToDo = 0; in chooseVariable() local
915 results_[numberToDo++] = OsiHotInfo(solver, info, in chooseVariable()
930 if (numberToDo) { in chooseVariable()
931 returnCode = doStrongBranching(solver, info, numberToDo, 1); in chooseVariable()
H A DOsiChooseVariable.hpp473 int numberToDo, int returnCriterion);
/dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/src/Algorithms/Branching/
H A DBonChooseVariable.hpp98 int numberToDo, int returnCriterion);
H A DBonChooseVariable.cpp789 int numberToDo, int returnCriterion) in doStrongBranching() argument
807 for (;iDo<numberToDo;iDo++) { in doStrongBranching()
949 if(iDo < numberToDo) iDo++; in doStrongBranching()
/dports/math/osi/Osi-0.108.6/CoinUtils/src/
H A DCoinFactorization2.cpp630 int numberToDo = -denseThreshold_; in factorDense() local
637 for (iDense = 0; iDense < numberToDo; iDense++) { in factorDense()
656 for (iColumn = numberGoodU_ + numberToDo; iColumn < numberRows_; iColumn++) { in factorDense()
668 for (iDense = 0; iDense < numberToDo; iDense++) { in factorDense()
728 for (jDense = iDense + 1; jDense < numberToDo; jDense++) { in factorDense()
H A DCoinPresolveTripleton.cpp843 int numberToDo = numberInColumn; in postsolve() local
844 for (i = 0; i < numberToDo; ++i) { in postsolve()
900 numberToDo = numberInColumn; in postsolve()
901 for (i = 0; i < numberToDo; ++i) { in postsolve()
/dports/math/coinutils/CoinUtils-2.11.4/CoinUtils/src/
H A DCoinFactorization2.cpp630 int numberToDo = -denseThreshold_; in factorDense() local
637 for (iDense = 0; iDense < numberToDo; iDense++) { in factorDense()
656 for (iColumn = numberGoodU_ + numberToDo; iColumn < numberRows_; iColumn++) { in factorDense()
668 for (iDense = 0; iDense < numberToDo; iDense++) { in factorDense()
728 for (jDense = iDense + 1; jDense < numberToDo; jDense++) { in factorDense()
H A DCoinPresolveTripleton.cpp843 int numberToDo = numberInColumn; in postsolve() local
844 for (i = 0; i < numberToDo; ++i) { in postsolve()
900 numberToDo = numberInColumn; in postsolve()
901 for (i = 0; i < numberToDo; ++i) { in postsolve()
/dports/math/ogdf/OGDF/src/coin/CoinUtils/
H A DCoinFactorization2.cpp573 int numberToDo=-denseThreshold_; in factorDense() local
580 for (iDense=0;iDense<numberToDo;iDense++) { in factorDense()
599 for (iColumn=numberGoodU_+numberToDo;iColumn<numberRows_;iColumn++) { in factorDense()
611 for (iDense=0;iDense<numberToDo;iDense++) { in factorDense()
671 for (jDense=iDense+1;jDense<numberToDo;jDense++) { in factorDense()
H A DCoinPresolveTripleton.cpp821 int numberToDo=numberInColumn; in postsolve() local
822 for (i=0; i<numberToDo; ++i) { in postsolve()
878 numberToDo=numberInColumn; in postsolve()
879 for (i=0; i<numberToDo; ++i) { in postsolve()
/dports/math/clp/Clp-1.17.3/CoinUtils/src/
H A DCoinFactorization2.cpp630 int numberToDo = -denseThreshold_; in factorDense() local
637 for (iDense = 0; iDense < numberToDo; iDense++) { in factorDense()
656 for (iColumn = numberGoodU_ + numberToDo; iColumn < numberRows_; iColumn++) { in factorDense()
668 for (iDense = 0; iDense < numberToDo; iDense++) { in factorDense()
728 for (jDense = iDense + 1; jDense < numberToDo; jDense++) { in factorDense()
H A DCoinPresolveTripleton.cpp843 int numberToDo = numberInColumn; in postsolve() local
844 for (i = 0; i < numberToDo; ++i) { in postsolve()
900 numberToDo = numberInColumn; in postsolve()
901 for (i = 0; i < numberToDo; ++i) { in postsolve()
/dports/math/clp/Clp-1.17.3/Clp/src/
H A DCoinAbcBaseFactorization2.cpp1239 CoinSimplexInt numberToDo = numberDense_; in factorDense() local
1244 for (iDense = 0; iDense < numberToDo; iDense++) { in factorDense()
1263 for (iColumn = numberGoodU_ + numberToDo; iColumn < numberRows_; iColumn++) { in factorDense()
1279 for (int iDense = 0; iDense < numberToDo; iDense++) { in factorDense()
1287 for (int iDense = 0; iDense < numberToDo; iDense++) { in factorDense()
H A DClpPackedMatrix.cpp345 int last = first + info.numberToDo; in transposeTimesBit()
596 int last = first + info.numberToDo; in transposeTimesSubsetBit()
1596 int last = first + info.numberToDo; in transposeTimesUnscaledBit()
1739 int last = first + info.numberToDo; in transposeTimesUnscaledBit2()
2032 int last = info.numberToDo; in packDownBit()
2323 } else if (numberToDo) { in subsetTransposeTimes()
2417 int last = first + info.numberToDo; in transposeTimes2UnscaledBit()
2517 int last = first + info.numberToDo; in transposeTimes2ScaledBit()
7957 int numberOdd = info.numberToDo;
8083 int lastBlock = info.numberToDo;
[all …]
H A DClpGubDynamicMatrix.cpp593 int numberToDo = 0; in synchronize() local
600 fromIndex_[numberToDo++] = iSet; in synchronize()
666 for (int jSet = 0; jSet < numberToDo; jSet++) { in synchronize()
1923 int numberToDo = 0; in times() local
1931 fromIndex_[numberToDo++] = iSet; in times()
1945 for (int jSet = 0; jSet < numberToDo; jSet++) { in times()
H A DClpNetworkMatrix.cpp486 int numberToDo = y->getNumElements(); in subsetTransposeTimes() local
491 for (jColumn = 0; jColumn < numberToDo; jColumn++) { in subsetTransposeTimes()
503 for (jColumn = 0; jColumn < numberToDo; jColumn++) { in subsetTransposeTimes()
/dports/math/ogdf/OGDF/include/coin/
H A DOsiChooseVariable.hpp405 int numberToDo, int returnCriterion);
/dports/math/ogdf/OGDF/src/coin/Clp/
H A DClpGubDynamicMatrix.cpp593 int numberToDo = 0; in synchronize() local
600 fromIndex_[numberToDo++] = iSet; in synchronize()
666 for (int jSet = 0; jSet < numberToDo; jSet++) { in synchronize()
1940 int numberToDo = 0; in times() local
1948 fromIndex_[numberToDo++] = iSet; in times()
1962 for (int jSet = 0; jSet < numberToDo; jSet++) { in times()
H A DClpNetworkMatrix.cpp494 int numberToDo = y->getNumElements(); in subsetTransposeTimes() local
499 for (jColumn = 0; jColumn < numberToDo; jColumn++) { in subsetTransposeTimes()
511 for (jColumn = 0; jColumn < numberToDo; jColumn++) { in subsetTransposeTimes()

12