| CglCutGenerator() | CglCutGenerator | |
| CglCutGenerator(const CglCutGenerator &) | CglCutGenerator | |
| CglKnapsackCover() | CglKnapsackCover | |
| CglKnapsackCover(const CglKnapsackCover &) | CglKnapsackCover | |
| CglKnapsackCoverUnitTest(const OsiSolverInterface *siP, const std::string mpdDir) | CglKnapsackCover | [friend] |
| deriveAKnapsack(const OsiSolverInterface &si, OsiCuts &cs, CoinPackedVector &krow, bool treatAsLRow, double &b, int *complement, double *xstar, int rowIndex, int numberElements, const int *index, const double *element) const | CglKnapsackCover | [private] |
| deriveAKnapsack(const OsiSolverInterface &si, OsiCuts &cs, CoinPackedVector &krow, double &b, int *complement, double *xstar, int rowIndex, const CoinPackedVectorBase &matrixRow) const (defined in CglKnapsackCover) | CglKnapsackCover | [private] |
| epsilon2_ | CglKnapsackCover | [private] |
| epsilon_ | CglKnapsackCover | [private] |
| exactSolveKnapsack(int n, double c, double const *pp, double const *ww, double &z, int *x) const | CglKnapsackCover | [private] |
| findExactMostViolatedMinCover(int nCols, int row, CoinPackedVector &krow, double b, double *xstar, CoinPackedVector &cover, CoinPackedVector &remainder) const | CglKnapsackCover | [private] |
| findGreedyCover(int row, CoinPackedVector &krow, double &b, double *xstar, CoinPackedVector &cover, CoinPackedVector &remainder) const | CglKnapsackCover | [private] |
| findJohnAndEllisCover(int row, CoinPackedVector &krow, double &b, double *xstar, CoinPackedVector &fracCover, CoinPackedVector &atOnes, CoinPackedVector &remainder) const | CglKnapsackCover | [private] |
| findLPMostViolatedMinCover(int nCols, int row, CoinPackedVector &krow, double &b, double *xstar, CoinPackedVector &cover, CoinPackedVector &remainder) const | CglKnapsackCover | [private] |
| findPseudoJohnAndEllisCover(int row, CoinPackedVector &krow, double &b, double *xstar, CoinPackedVector &cover, CoinPackedVector &remainder) const | CglKnapsackCover | [private] |
| generateCuts(const OsiSolverInterface &si, OsiCuts &cs) const | CglKnapsackCover | [virtual] |
| getMaxInKnapsack() const | CglKnapsackCover | [inline] |
| liftAndUncomplementAndAdd(double rowub, CoinPackedVector &krow, double &b, int *complement, int row, CoinPackedVector &cover, CoinPackedVector &remainder, OsiCuts &cs) const | CglKnapsackCover | [private] |
| liftCoverCut(double &b, int nRowElem, CoinPackedVector &cover, CoinPackedVector &remainder, CoinPackedVector &cut) const | CglKnapsackCover | [private] |
| liftUpDownAndUncomplementAndAdd(int nCols, double *xstar, int *complement, int row, int nRowElem, double &b, CoinPackedVector &fracCover, CoinPackedVector &atOne, CoinPackedVector &remainder, OsiCuts &cs) const | CglKnapsackCover | [private] |
| maxInKnapsack_ | CglKnapsackCover | [private] |
| numRowsToCheck_ | CglKnapsackCover | [private] |
| onetol_ | CglKnapsackCover | [private] |
| operator=(const CglKnapsackCover &rhs) | CglKnapsackCover | |
| CglCutGenerator::operator=(const CglCutGenerator &rhs) | CglCutGenerator | |
| refreshSolver(OsiSolverInterface *solver) | CglCutGenerator | [inline, virtual] |
| rowsToCheck_ (defined in CglKnapsackCover) | CglKnapsackCover | [private] |
| seqLiftAndUncomplementAndAdd(int nCols, double *xstar, int *complement, int row, int nRowElem, double &b, CoinPackedVector &cover, CoinPackedVector &remainder, OsiCuts &cs) const | CglKnapsackCover | [private] |
| setMaxInKnapsack(int value) | CglKnapsackCover | [inline] |
| setTestedRowIndices(int num, const int *ind) | CglKnapsackCover | |
| ~CglCutGenerator() | CglCutGenerator | [virtual] |
| ~CglKnapsackCover() | CglKnapsackCover | [virtual] |
