| branchCutIndexes | OSBearcatSolverXij | |
| branchCutValues | OSBearcatSolverXij | |
| calcNonlinearRelax(std::vector< double > &m_zRootLPx_vals) | OSBearcatSolverXij | |
| calcReducedCost(const double *yA, const double *yB) | OSBearcatSolverXij | |
| createAmatrix() | OSBearcatSolverXij | |
| createVariableNames() | OSBearcatSolverXij | |
| getBranchingCut(const double *thetaVar, const int numThetaVar, const std::map< int, int > &varConMap, int &varIdx, int &numNonz, int *&indexes, double *&values) | OSBearcatSolverXij | virtual |
| getBranchingCut(const int *thetaIdx, const double *theta, const int numThetaVar, const std::map< int, int > &varConMap, int &varIdx, int &numNonz, int *&indexes, double *&values) | OSBearcatSolverXij | virtual |
| getBranchingVar(const double *theta, const int numThetaVar) | OSBearcatSolverXij | |
| getBranchingVar(const int *thetaIdx, const double *theta, const int numThetaVar) | OSBearcatSolverXij | |
| getColumns(const double *yA, const int numARows, const double *yB, const int numBRows, int &numNewColumns, int *&numNonz, double *&cost, int **&rowIdx, double **&values, double &lowerBound) | OSBearcatSolverXij | virtual |
| getCutsMultiCommod(const double *thetaVar, const int numThetaVar, int &numNewRows, int *&numNonz, int **&colIdx, double **&values, double *&rowLB, double *&rowUB) | OSBearcatSolverXij | virtual |
| getCutsTheta(const double *thetaVar, const int numThetaVar, int &numNewRows, int *&numNonz, int **&colIdx, double **&values, double *&rowLB, double *&rowUB) | OSBearcatSolverXij | virtual |
| getCutsX(const double *xVar, const int numXVar, int &numNewRows, int *&numNonz, int **&colIdx, double **&values, double *&rowLB, double *&rowUB) | OSBearcatSolverXij | |
| getFeasibleSolution() | OSBearcatSolverXij | |
| getInitialRestrictedMaster() | OSBearcatSolverXij | virtual |
| getInitialSolution() | OSBearcatSolverXij | |
| getMultiCommodInstance(int hubIndex) | OSBearcatSolverXij | |
| getOptions(OSOption *osoption) | OSBearcatSolverXij | |
| getOptL(double **c) | OSBearcatSolverXij | |
| getRouteDistance(int numNodes, int hubIndex, CoinSolver *solver, std::vector< int > zk, double *xVar) | OSBearcatSolverXij | |
| getSeparationInstance() | OSBearcatSolverXij | |
| getTSP(int numNodes, double *cost) | OSBearcatSolverXij | |
| getVariableIndexMap() | OSBearcatSolverXij | |
| initializeDataStructures() | OSBearcatSolverXij | virtual |
| intVarSet | OSDecompSolver | |
| m_Amatrix | OSDecompSolver | |
| m_bestIPValue | OSDecompSolver | |
| m_bestLPValue | OSDecompSolver | |
| m_BmatrixIdx | OSDecompSolver | |
| m_BmatrixRowIndex | OSBearcatSolverXij | |
| m_BmatrixVal | OSDecompSolver | |
| m_convexityRowIndex | OSBearcatSolverXij | |
| m_cost | OSBearcatSolverXij | |
| m_costSetInOption | OSBearcatSolverXij | |
| m_costVec | OSBearcatSolverXij | |
| m_demand | OSBearcatSolverXij | |
| m_g | OSBearcatSolverXij | |
| m_hubPoint | OSBearcatSolverXij | |
| m_initOSiLFile | OSBearcatSolverXij | |
| m_initSolMap | OSBearcatSolverXij | |
| m_lowerBnd | OSBearcatSolverXij | |
| m_lowerBoundL | OSBearcatSolverXij | |
| m_maxBmatrixCon | OSDecompSolver | |
| m_maxBmatrixNonz | OSDecompSolver | |
| m_maxMasterColumns | OSDecompSolver | |
| m_maxMasterRows | OSDecompSolver | |
| m_maxThetaNonz | OSBearcatSolverXij | |
| m_minDemand | OSBearcatSolverXij | |
| m_multCommodCutSolvers | OSBearcatSolverXij | |
| m_multiCommodCutLimit | OSDecompSolver | |
| m_newColumnNonz | OSBearcatSolverXij | |
| m_newColumnRowIdx | OSBearcatSolverXij | |
| m_newColumnRowValue | OSBearcatSolverXij | |
| m_newRowColumnIdx | OSBearcatSolverXij | |
| m_newRowColumnValue | OSBearcatSolverXij | |
| m_newRowLB | OSBearcatSolverXij | |
| m_newRowNonz | OSBearcatSolverXij | |
| m_newRowUB | OSBearcatSolverXij | |
| m_nodeName | OSBearcatSolverXij | |
| m_numberOfSolutions | OSBearcatSolverXij | |
| m_numBmatrixCon | OSDecompSolver | |
| m_numBmatrixNonz | OSDecompSolver | |
| m_numHubs | OSDecompSolver | |
| m_numMultCuts | OSDecompSolver | |
| m_numNodes | OSDecompSolver | |
| m_numThetaNonz | OSDecompSolver | |
| m_numThetaVar | OSDecompSolver | |
| m_optD | OSBearcatSolverXij | |
| m_optL | OSBearcatSolverXij | |
| m_optValHub | OSBearcatSolverXij | |
| m_osDecompParam | OSDecompSolver | |
| m_osinstanceMaster | OSDecompSolver | |
| m_osinstanceSeparation | OSBearcatSolverXij | |
| m_osoption | OSDecompSolver | |
| m_pntAmatrix | OSDecompSolver | |
| m_pntBmatrix | OSDecompSolver | |
| m_px | OSBearcatSolverXij | |
| m_rc | OSBearcatSolverXij | |
| m_rootLPValue | OSDecompSolver | |
| m_routeCapacity | OSBearcatSolverXij | |
| m_routeMinPickup | OSBearcatSolverXij | |
| m_separationClpModel | OSBearcatSolverXij | |
| m_separationIndexMap | OSBearcatSolverXij | |
| m_thetaCost | OSBearcatSolverXij | |
| m_thetaIndex | OSDecompSolver | |
| m_thetaPnt | OSDecompSolver | |
| m_tmpScatterArray | OSBearcatSolverXij | |
| m_tmpVarMap | OSBearcatSolverXij | |
| m_totalDemand | OSBearcatSolverXij | |
| m_tx | OSBearcatSolverXij | |
| m_u | OSBearcatSolverXij | |
| m_upperBoundL | OSBearcatSolverXij | |
| m_upperBoundLMax | OSBearcatSolverXij | |
| m_use1OPTstart | OSBearcatSolverXij | |
| m_v | OSBearcatSolverXij | |
| m_variableNames | OSDecompSolver | |
| m_varIdx | OSBearcatSolverXij | |
| m_vv | OSBearcatSolverXij | |
| m_vvpnt | OSBearcatSolverXij | |
| m_xVarIndexMap | OSBearcatSolverXij | |
| OneOPT() | OSBearcatSolverXij | |
| OSBearcatSolverXij() | OSBearcatSolverXij | |
| OSBearcatSolverXij(OSOption *osoption) | OSBearcatSolverXij | |
| OSDecompSolver() | OSDecompSolver | |
| OSDecompSolver(OSOption *osoption) | OSDecompSolver | |
| pauHana(std::vector< int > &m_zOptIndexes, std::vector< double > &m_zRootLPx_vals, int numNodes, int numColsGen, std::string message) | OSBearcatSolverXij | virtual |
| permuteHubs() | OSBearcatSolverXij | |
| qrouteCost(const int &k, const int &l, const double *c, int *kountVar) | OSBearcatSolverXij | |
| resetMaster(std::map< int, int > &inVars, OsiSolverInterface *si) | OSBearcatSolverXij | virtual |
| ~OSBearcatSolverXij() | OSBearcatSolverXij | |
| ~OSDecompSolver()=0 | OSDecompSolver | pure virtual |
