AbcAllowableGap enum value | AbcModel | |
AbcCutoffIncrement enum value | AbcModel | |
AbcDblParam enum name | AbcModel | |
AbcFathomDiscipline enum value | AbcModel | |
AbcInfeasibilityWeight enum value | AbcModel | |
AbcIntegerTolerance enum value | AbcModel | |
AbcIntParam enum name | AbcModel | |
AbcLastDblParam enum value | AbcModel | |
AbcLastIntParam enum value | AbcModel | |
AbcMaximumSeconds enum value | AbcModel | |
AbcMaxNumNode enum value | AbcModel | |
AbcMaxNumSol enum value | AbcModel | |
AbcModel() | AbcModel | [inline] |
AbcModel(const OsiSolverInterface &rhs) | AbcModel | [inline] |
AbcPar() | AbcModel | [inline] |
AbcPar_ | AbcModel | [private] |
addCutGenerator(CglCutGenerator *generator, int howOften=1, const char *name=NULL, bool normal=true, bool atSolution=false, bool infeasible=false) | AbcModel | |
addHeuristic(AbcHeuristic *generator) | AbcModel | |
AlpsKnowledge() | AlpsKnowledge | [inline] |
AlpsModel() | AlpsModel | [inline] |
AlpsPar() | AlpsModel | [inline] |
AlpsPar_ | AlpsModel | [protected] |
assignSolver(OsiSolverInterface *&solver) | AbcModel | |
basis_ | AbcModel | [private] |
bestObjective_ | AbcModel | [private] |
bestSolution() const | AbcModel | [inline] |
bestSolution_ | AbcModel | [private] |
branchingMethod() const | AbcModel | [inline] |
branchingMethod_ | AbcModel | [private] |
broker_ | AlpsModel | [protected] |
checkInteger(double value) const | AbcModel | [inline] |
checkSolution(double cutoff, const double *solution, bool fixVariables) | AbcModel | |
continuousSolver_ | AbcModel | [private] |
createRoot() | AlpsModel | [inline, virtual] |
currentNumberCuts() const | AbcModel | [inline] |
currentNumberCuts_ | AbcModel | [private] |
currentSolution() const | AbcModel | [inline] |
currentSolution_ | AbcModel | [private] |
dataFile_ | AlpsModel | [protected] |
dblParam_ | AbcModel | [private] |
decode(AlpsEncoded &encoded) const | AlpsKnowledge | [virtual] |
decodeAlps(AlpsEncoded &encoded) | AlpsModel | |
decodeToSelf(AlpsEncoded &) | AbcModel | [virtual] |
defaultHandler_ | AbcModel | [private] |
encode() const | AbcModel | [virtual] |
AlpsModel::encode(AlpsEncoded *encoded) | AlpsKnowledge | [inline, virtual] |
encodeAlps(AlpsEncoded *encoded) const | AlpsModel | |
feasibleSolution(int &numberIntegerInfeasibilities) | AbcModel | |
findIntegers(bool startAgain) | AbcModel | |
generator_ | AbcModel | [private] |
getAllowableGap() const | AbcModel | [inline] |
getColLower() const | AbcModel | [inline] |
getColSolution() const | AbcModel | [inline] |
getColUpper() const | AbcModel | [inline] |
getCurrentObjValue() const | AbcModel | [inline] |
getCutoff() const | AbcModel | [inline] |
getDataFile() const | AlpsModel | [inline] |
getDblParam(AbcDblParam key) const | AbcModel | [inline] |
getEmptyBasis(int ns=0, int na=0) const | AbcModel | |
getEncoded() const | AlpsKnowledge | [inline] |
getInfeasibilityWeight() const | AbcModel | [inline] |
getInfinity() const | AbcModel | [inline] |
getIntegerTolerance() const | AbcModel | [inline] |
getIntParam(AbcIntParam key) const | AbcModel | [inline] |
getIterationCount() const | AbcModel | [inline] |
getKnowledgeBroker() | AlpsModel | [inline] |
getMatrixByCol() const | AbcModel | [inline] |
getMatrixByRow() const | AbcModel | [inline] |
getMaximumCutPasses() const | AbcModel | [inline] |
getMaximumCutPassesAtRoot() const | AbcModel | [inline] |
getMaximumNodes() const | AbcModel | [inline] |
getMaximumSolutions() const | AbcModel | [inline] |
getMinimumDrop() const | AbcModel | [inline] |
getNodeCount() const | AbcModel | [inline] |
getNumberHeuristicSolutions() const | AbcModel | [inline] |
getNumCols() const | AbcModel | [inline] |
getNumElements() const | AbcModel | [inline] |
getNumRows() const | AbcModel | [inline] |
getObjCoefficients() const | AbcModel | [inline] |
getObjSense() const | AbcModel | [inline] |
getObjValue() const | AbcModel | [inline] |
getPseudoIndices() | AbcModel | [inline] |
getPseudoList() | AbcModel | [inline] |
getReducedCost() const | AbcModel | [inline] |
getRightHandSide() const | AbcModel | [inline] |
getRowActivity() const | AbcModel | [inline] |
getRowLower() const | AbcModel | [inline] |
getRowPrice() const | AbcModel | [inline] |
getRowRange() const | AbcModel | [inline] |
getRowSense() const | AbcModel | [inline] |
getRowUpper() const | AbcModel | [inline] |
getSolutionCount() const | AbcModel | [inline] |
getType() | AlpsKnowledge | [inline] |
globalCuts_ | AbcModel | [private] |
handler_ | AbcModel | [private] |
heuristic_ | AbcModel | [private] |
howOftenGlobalScan_ | AbcModel | [private] |
incrementNodeCount(int s=1) | AbcModel | [inline] |
init() | AbcModel | [inline] |
initialSolve() | AbcModel | |
integerVariable() const | AbcModel | [inline] |
integerVariable_ | AbcModel | [private] |
intParam_ | AbcModel | [private] |
isAbandoned() const | AbcModel | |
isBinary(int colIndex) const | AbcModel | [inline] |
isContinuous(int colIndex) const | AbcModel | [inline] |
isFreeBinary(int colIndex) const | AbcModel | [inline] |
isInteger(int colIndex) const | AbcModel | [inline] |
isIntegerNonBinary(int colIndex) const | AbcModel | [inline] |
isNodeLimitReached() const | AbcModel | |
isProvenInfeasible() const | AbcModel | |
isProvenOptimal() const | AbcModel | |
isSolutionLimitReached() const | AbcModel | |
lastws_ | AbcModel | [private] |
maximumCutPasses_ | AbcModel | [private] |
maximumCutPassesAtRoot_ | AbcModel | [private] |
maximumDepth_ | AbcModel | [private] |
maximumNumberCuts_ | AbcModel | [private] |
messageHandler() const | AbcModel | [inline] |
messages() | AbcModel | [inline] |
messages_ | AbcModel | [private] |
messagesPointer() | AbcModel | [inline] |
minimumDrop_ | AbcModel | [private] |
modelLog() | AlpsModel | [inline, virtual] |
newLanguage(CoinMessages::Language language) | AbcModel | [inline] |
nodeLog(AlpsTreeNode *node, bool force) | AlpsModel | [virtual] |
numberCutGenerators_ | AbcModel | [private] |
numberHeuristics_ | AbcModel | [private] |
numberHeuristicSolutions_ | AbcModel | [private] |
numberIntegers() const | AbcModel | [inline] |
numberIntegers_ | AbcModel | [private] |
numberIterations_ | AbcModel | [private] |
numberNodes_ | AbcModel | [private] |
numberRowsAtContinuous() const | AbcModel | [inline] |
numberRowsAtContinuous_ | AbcModel | [private] |
numberSolutions_ | AbcModel | [private] |
numberStrong() const | AbcModel | [inline] |
numberStrong_ | AbcModel | [private] |
ourSolver_ | AbcModel | [private] |
packSharedKnowlege() | AlpsModel | [inline, virtual] |
passInMessageHandler(CoinMessageHandler *handler) | AbcModel | [inline] |
postprocess() | AlpsModel | [inline, virtual] |
preprocess() | AlpsModel | [inline, virtual] |
priority() const | AbcModel | [inline] |
priority(int sequence) const | AbcModel | [inline] |
priority_ | AbcModel | [private] |
pseudoIndices_ | AbcModel | [private] |
pseudoList_ | AbcModel | [private] |
readInstance(const char *dataFile) | AbcModel | [inline, virtual] |
readParameters(const int argnum, const char *const *arglist) | AbcModel | [inline, virtual] |
receiveGeneratedKnowledge() | AlpsModel | [inline, virtual] |
reducedCostFix() | AbcModel | |
registerKnowledge() | AlpsModel | [inline, virtual] |
resolve() | AbcModel | |
sendGeneratedKnowledge() | AlpsModel | [inline, virtual] |
setAllowableGap(double value) | AbcModel | [inline] |
setBestSolution(ABC_Message how, double &objectiveValue, const double *solution, bool fixVariables=false) | AbcModel | |
setBranchingMethod(AbcBranchDecision *method) | AbcModel | [inline] |
setBranchingMethod(AbcBranchDecision &method) | AbcModel | [inline] |
setCurrentNumberCuts(int value) | AbcModel | [inline] |
setCutoff(double value) | AbcModel | |
setDataFile(std::string infile) | AlpsModel | [inline] |
setDblParam(AbcDblParam key, double value) | AbcModel | [inline] |
setEncoded(AlpsEncoded *e) | AlpsKnowledge | [inline] |
setInfeasibilityWeight(double value) | AbcModel | [inline] |
setIntegerTolerance(double value) | AbcModel | [inline] |
setIntParam(AbcIntParam key, int value) | AbcModel | [inline] |
setKnowledgeBroker(AlpsKnowledgeBroker *b) | AlpsModel | [inline] |
setLanguage(CoinMessages::Language language) | AbcModel | [inline] |
setMaximumCutPasses(int value) | AbcModel | [inline] |
setMaximumCutPassesAtRoot(int value) | AbcModel | [inline] |
setMaximumNodes(int value) | AbcModel | [inline] |
setMaximumSolutions(int value) | AbcModel | [inline] |
setMinimumDrop(double value) | AbcModel | [inline] |
setNumberRowsAtContinous(const int value) | AbcModel | [inline] |
setNumberStrong(int number) | AbcModel | [inline] |
setObjSense(double s) | AbcModel | [inline] |
setObjValue(double obj) | AbcModel | [inline] |
setSolutionCount(int value) | AbcModel | [inline] |
setType(KnowledgeType t) | AlpsKnowledge | [inline] |
setupSelf() | AbcModel | [virtual] |
sharedBasis_ | AbcModel | [private] |
solver() const | AbcModel | [inline] |
solver_ | AbcModel | [private] |
solveWithCuts(OsiCuts &cuts, int numberTries, AbcTreeNode *node, int &numberOldActiveCuts, int &numberNewCuts, int &maximumWhich, int *&whichGenerator, const bool cutDuringRampup, int &found) | AbcModel | |
status() const | AbcModel | [inline] |
status_ | AbcModel | [private] |
takeOffCuts() | AbcModel | |
type_ | AlpsKnowledge | [protected] |
unpackSharedKnowledge(AlpsEncoded &) | AlpsModel | [inline, virtual] |
writeParameters(std::ostream &outstream) const | AlpsModel | |
~AbcModel() | AbcModel | [inline] |
~AlpsKnowledge() | AlpsKnowledge | [inline, virtual] |
~AlpsModel() | AlpsModel | [inline, virtual] |