00001
00002
00003
00004
00005
00006 #ifndef CbcModel_H
00007 #define CbcModel_H
00008 #include <string>
00009 #include <vector>
00010 #include "CoinMessageHandler.hpp"
00011 #include "OsiSolverInterface.hpp"
00012 #include "OsiBranchingObject.hpp"
00013 #include "OsiCuts.hpp"
00014 #include "CoinWarmStartBasis.hpp"
00015 #include "CbcCompareBase.hpp"
00016 #include "CbcMessage.hpp"
00017 #include "CbcEventHandler.hpp"
00018 #include "ClpDualRowPivot.hpp"
00019
00020
00021 class CbcCutGenerator;
00022 class CbcBaseModel;
00023 class OsiRowCut;
00024 class OsiBabSolver;
00025 class OsiRowCutDebugger;
00026 class CglCutGenerator;
00027 class CglStored;
00028 class CbcCutModifier;
00029 class CglTreeProbingInfo;
00030 class CbcHeuristic;
00031 class OsiObject;
00032 class CbcThread;
00033 class CbcTree;
00034 class CbcStrategy;
00035 class CbcFeasibilityBase;
00036 class CbcStatistics;
00037 class CbcEventHandler ;
00038 class CglPreProcess;
00039 # ifdef COIN_HAS_CLP
00040 class OsiClpSolverInterface;
00041 class ClpNodeStuff;
00042 #endif
00043
00044
00045
00046
00099 class CbcModel {
00100
00101 public:
00102
00103 enum CbcIntParam {
00105 CbcMaxNumNode = 0,
00107 CbcMaxNumSol,
00117 CbcFathomDiscipline,
00121 CbcPrinting,
00124 CbcNumberBranches,
00126 CbcLastIntParam
00127 };
00128
00129 enum CbcDblParam {
00132 CbcIntegerTolerance = 0,
00135 CbcInfeasibilityWeight,
00138 CbcCutoffIncrement,
00145 CbcAllowableGap,
00152 CbcAllowableFractionGap,
00155 CbcMaximumSeconds,
00157 CbcCurrentCutoff,
00159 CbcOptimizationDirection,
00161 CbcCurrentObjectiveValue,
00163 CbcCurrentMinimizationObjectiveValue,
00166 CbcStartSeconds,
00174 CbcHeuristicGap,
00182 CbcHeuristicFractionGap,
00184 CbcSmallestChange,
00186 CbcSumChange,
00188 CbcLargestChange,
00190 CbcSmallChange,
00192 CbcLastDblParam
00193 };
00194
00195
00196
00197 public:
00199
00200
00204 void initialSolve();
00205
00216 void branchAndBound(int doStatistics = 0);
00217 private:
00218
00226 bool solveWithCuts(OsiCuts & cuts, int numberTries, CbcNode * node);
00234 int serialCuts(OsiCuts & cuts, CbcNode * node, OsiCuts & slackCuts, int lastNumberCuts);
00242 int parallelCuts(CbcBaseModel * master, OsiCuts & cuts, CbcNode * node, OsiCuts & slackCuts, int lastNumberCuts);
00249 CbcNode ** solveOneNode(int whichSolver, CbcNode * node,
00250 int & numberNodesOutput, int & status) ;
00252 void resizeWhichGenerator(int numberNow, int numberAfter);
00253 public:
00254 #ifdef CBC_KEEP_DEPRECATED
00255
00260 CbcModel * cleanModel(const double * lower, const double * upper);
00277 int subBranchAndBound(CbcModel * model2,
00278 CbcModel * presolvedModel,
00279 int maximumNodes);
00295 int subBranchAndBound(const double * lower, const double * upper,
00296 int maximumNodes);
00297
00304 OsiSolverInterface * strengthenedModel();
00314 CglPreProcess * preProcess( int makeEquality = 0, int numberPasses = 5,
00315 int tuning = 5);
00318 void postProcess(CglPreProcess * process);
00319 #endif
00321 void addUpdateInformation(const CbcObjectUpdateData & data);
00322
00328 int doOneNode(CbcModel * baseModel, CbcNode * & node, CbcNode * & newNode);
00329
00330 public:
00344 int resolve(CbcNodeInfo * parent, int whereFrom,
00345 double * saveSolution = NULL,
00346 double * saveLower = NULL,
00347 double * saveUpper = NULL);
00349 void makeGlobalCuts(int numberRows, const int * which);
00351 void makeGlobalCut(const OsiRowCut * cut);
00353 void makeGlobalCut(const OsiRowCut & cut);
00355 void makeGlobalCut(const OsiColCut * cut);
00357 void makeGlobalCut(const OsiColCut & cut);
00359
00362
00374 CbcModel * findCliques(bool makeEquality, int atLeastThisMany,
00375 int lessThanThis, int defaultValue = 1000);
00376
00385 CbcModel * integerPresolve(bool weak = false);
00386
00391 bool integerPresolveThisModel(OsiSolverInterface * originalSolver, bool weak = false);
00392
00393
00395 void originalModel(CbcModel * presolvedModel, bool weak);
00396
00417 bool tightenVubs(int type, bool allowMultipleBinary = false,
00418 double useCutoff = 1.0e50);
00419
00425 bool tightenVubs(int numberVubs, const int * which,
00426 double useCutoff = 1.0e50);
00430 void analyzeObjective();
00431
00435 void AddIntegers();
00436
00440 void saveModel(OsiSolverInterface * saveSolver, double * checkCutoffForRestart, bool * feasible);
00441
00443
00449
00451 inline int numberObjects() const {
00452 return numberObjects_;
00453 }
00455 inline void setNumberObjects(int number) {
00456 numberObjects_ = number;
00457 }
00458
00460 inline OsiObject ** objects() const {
00461 return object_;
00462 }
00463
00465 const inline OsiObject * object(int which) const {
00466 return object_[which];
00467 }
00469 inline OsiObject * modifiableObject(int which) const {
00470 return object_[which];
00471 }
00472
00473 void setOptionalInteger(int index);
00474
00476 void deleteObjects(bool findIntegers = true);
00477
00482 void addObjects(int numberObjects, OsiObject ** objects);
00483
00488 void addObjects(int numberObjects, CbcObject ** objects);
00489
00491 void synchronizeModel() ;
00492
00502 void findIntegers(bool startAgain, int type = 0);
00503
00505
00506
00507
00517
00518 inline bool setIntParam(CbcIntParam key, int value) {
00519 intParam_[key] = value;
00520 return true;
00521 }
00523 inline bool setDblParam(CbcDblParam key, double value) {
00524 dblParam_[key] = value;
00525 return true;
00526 }
00528 inline int getIntParam(CbcIntParam key) const {
00529 return intParam_[key];
00530 }
00532 inline double getDblParam(CbcDblParam key) const {
00533 return dblParam_[key];
00534 }
00540 void setCutoff(double value) ;
00541
00543 inline double getCutoff() const {
00544
00545
00546 return dblParam_[CbcCurrentCutoff];
00547 }
00548
00550 inline bool setMaximumNodes( int value) {
00551 return setIntParam(CbcMaxNumNode, value);
00552 }
00553
00555 inline int getMaximumNodes() const {
00556 return getIntParam(CbcMaxNumNode);
00557 }
00558
00563 inline bool setMaximumSolutions( int value) {
00564 return setIntParam(CbcMaxNumSol, value);
00565 }
00570 inline int getMaximumSolutions() const {
00571 return getIntParam(CbcMaxNumSol);
00572 }
00574 inline bool setPrintingMode( int value) {
00575 return setIntParam(CbcPrinting, value);
00576 }
00577
00579 inline int getPrintingMode() const {
00580 return getIntParam(CbcPrinting);
00581 }
00582
00587 inline bool setMaximumSeconds( double value) {
00588 return setDblParam(CbcMaximumSeconds, value);
00589 }
00594 inline double getMaximumSeconds() const {
00595 return getDblParam(CbcMaximumSeconds);
00596 }
00598 double getCurrentSeconds() const ;
00599
00601 bool maximumSecondsReached() const ;
00602
00606 inline bool setIntegerTolerance( double value) {
00607 return setDblParam(CbcIntegerTolerance, value);
00608 }
00612 inline double getIntegerTolerance() const {
00613 return getDblParam(CbcIntegerTolerance);
00614 }
00615
00620 inline bool setInfeasibilityWeight( double value) {
00621 return setDblParam(CbcInfeasibilityWeight, value);
00622 }
00627 inline double getInfeasibilityWeight() const {
00628 return getDblParam(CbcInfeasibilityWeight);
00629 }
00630
00634 inline bool setAllowableGap( double value) {
00635 return setDblParam(CbcAllowableGap, value);
00636 }
00640 inline double getAllowableGap() const {
00641 return getDblParam(CbcAllowableGap);
00642 }
00643
00647 inline bool setAllowableFractionGap( double value) {
00648 return setDblParam(CbcAllowableFractionGap, value);
00649 }
00653 inline double getAllowableFractionGap() const {
00654 return getDblParam(CbcAllowableFractionGap);
00655 }
00659 inline bool setAllowablePercentageGap( double value) {
00660 return setDblParam(CbcAllowableFractionGap, value*0.01);
00661 }
00665 inline double getAllowablePercentageGap() const {
00666 return 100.0*getDblParam(CbcAllowableFractionGap);
00667 }
00671 inline bool setHeuristicGap( double value) {
00672 return setDblParam(CbcHeuristicGap, value);
00673 }
00677 inline double getHeuristicGap() const {
00678 return getDblParam(CbcHeuristicGap);
00679 }
00680
00684 inline bool setHeuristicFractionGap( double value) {
00685 return setDblParam(CbcHeuristicFractionGap, value);
00686 }
00690 inline double getHeuristicFractionGap() const {
00691 return getDblParam(CbcHeuristicFractionGap);
00692 }
00697 inline bool setCutoffIncrement( double value) {
00698 return setDblParam(CbcCutoffIncrement, value);
00699 }
00704 inline double getCutoffIncrement() const {
00705 return getDblParam(CbcCutoffIncrement);
00706 }
00707
00712 void setHotstartSolution(const double * solution, const int * priorities = NULL) ;
00713
00715 inline void setMinimumDrop(double value) {
00716 minimumDrop_ = value;
00717 }
00719 inline double getMinimumDrop() const {
00720 return minimumDrop_;
00721 }
00722
00725 inline void setMaximumCutPassesAtRoot(int value) {
00726 maximumCutPassesAtRoot_ = value;
00727 }
00729 inline int getMaximumCutPassesAtRoot() const {
00730 return maximumCutPassesAtRoot_;
00731 }
00732
00735 inline void setMaximumCutPasses(int value) {
00736 maximumCutPasses_ = value;
00737 }
00739 inline int getMaximumCutPasses() const {
00740 return maximumCutPasses_;
00741 }
00744 inline int getCurrentPassNumber() const {
00745 return currentPassNumber_;
00746 }
00747
00753 void setNumberStrong(int number);
00757 inline int numberStrong() const {
00758 return numberStrong_;
00759 }
00762 inline void setPreferredWay(int value) {
00763 preferredWay_ = value;
00764 }
00766 inline int getPreferredWay() const {
00767 return preferredWay_;
00768 }
00770 inline int whenCuts() const {
00771 return whenCuts_;
00772 }
00774 inline void setWhenCuts(int value) {
00775 whenCuts_ = value;
00776 }
00782 bool doCutsNow(int allowForTopOfTree) const;
00783
00789 void setNumberBeforeTrust(int number);
00792 inline int numberBeforeTrust() const {
00793 return numberBeforeTrust_;
00794 }
00800 void setNumberPenalties(int number);
00803 inline int numberPenalties() const {
00804 return numberPenalties_;
00805 }
00807 inline void setNumberAnalyzeIterations(int number) {
00808 numberAnalyzeIterations_ = number;
00809 }
00810 inline int numberAnalyzeIterations() const {
00811 return numberAnalyzeIterations_;
00812 }
00815 inline double penaltyScaleFactor() const {
00816 return penaltyScaleFactor_;
00817 }
00820 void setPenaltyScaleFactor(double value);
00828 void inline setProblemType(int number) {
00829 problemType_ = number;
00830 }
00831 inline int problemType() const {
00832 return problemType_;
00833 }
00835 inline int currentDepth() const {
00836 return currentDepth_;
00837 }
00838
00840 void setHowOftenGlobalScan(int number);
00842 inline int howOftenGlobalScan() const {
00843 return howOftenGlobalScan_;
00844 }
00846 inline int * originalColumns() const {
00847 return originalColumns_;
00848 }
00850 void setOriginalColumns(const int * originalColumns) ;
00851
00859 inline void setPrintFrequency(int number) {
00860 printFrequency_ = number;
00861 }
00863 inline int printFrequency() const {
00864 return printFrequency_;
00865 }
00867
00868
00870
00871
00872 bool isAbandoned() const;
00874 bool isProvenOptimal() const;
00876 bool isProvenInfeasible() const;
00878 bool isContinuousUnbounded() const;
00880 bool isProvenDualInfeasible() const;
00882 bool isNodeLimitReached() const;
00884 bool isSecondsLimitReached() const;
00886 bool isSolutionLimitReached() const;
00888 inline int getIterationCount() const {
00889 return numberIterations_;
00890 }
00892 inline void incrementIterationCount(int value) {
00893 numberIterations_ += value;
00894 }
00896 inline int getNodeCount() const {
00897 return numberNodes_;
00898 }
00900 inline void incrementNodeCount(int value) {
00901 numberNodes_ += value;
00902 }
00912 inline int status() const {
00913 return status_;
00914 }
00915 inline void setProblemStatus(int value) {
00916 status_ = value;
00917 }
00929 inline int secondaryStatus() const {
00930 return secondaryStatus_;
00931 }
00932 inline void setSecondaryStatus(int value) {
00933 secondaryStatus_ = value;
00934 }
00936 bool isInitialSolveAbandoned() const ;
00938 bool isInitialSolveProvenOptimal() const ;
00940 bool isInitialSolveProvenPrimalInfeasible() const ;
00942 bool isInitialSolveProvenDualInfeasible() const ;
00943
00945
00946
00959
00960 inline int numberRowsAtContinuous() const {
00961 return numberRowsAtContinuous_;
00962 }
00963
00965 inline int getNumCols() const {
00966 return solver_->getNumCols();
00967 }
00968
00970 inline int getNumRows() const {
00971 return solver_->getNumRows();
00972 }
00973
00975 inline CoinBigIndex getNumElements() const {
00976 return solver_->getNumElements();
00977 }
00978
00980 inline int numberIntegers() const {
00981 return numberIntegers_;
00982 }
00983
00984 inline const int * integerVariable() const {
00985 return integerVariable_;
00986 }
00988 inline char integerType(int i) const {
00989 assert (integerInfo_);
00990 assert (integerInfo_[i] == 0 || integerInfo_[i] == 1);
00991 return integerInfo_[i];
00992 }
00994 inline const char * integerType() const {
00995 return integerInfo_;
00996 }
00997
00999 inline const double * getColLower() const {
01000 return solver_->getColLower();
01001 }
01002
01004 inline const double * getColUpper() const {
01005 return solver_->getColUpper();
01006 }
01007
01017 inline const char * getRowSense() const {
01018 return solver_->getRowSense();
01019 }
01020
01029 inline const double * getRightHandSide() const {
01030 return solver_->getRightHandSide();
01031 }
01032
01041 inline const double * getRowRange() const {
01042 return solver_->getRowRange();
01043 }
01044
01046 inline const double * getRowLower() const {
01047 return solver_->getRowLower();
01048 }
01049
01051 inline const double * getRowUpper() const {
01052 return solver_->getRowUpper();
01053 }
01054
01056 inline const double * getObjCoefficients() const {
01057 return solver_->getObjCoefficients();
01058 }
01059
01061 inline double getObjSense() const {
01062
01063 return dblParam_[CbcOptimizationDirection];
01064 }
01065
01067 inline bool isContinuous(int colIndex) const {
01068 return solver_->isContinuous(colIndex);
01069 }
01070
01072 inline bool isBinary(int colIndex) const {
01073 return solver_->isBinary(colIndex);
01074 }
01075
01080 inline bool isInteger(int colIndex) const {
01081 return solver_->isInteger(colIndex);
01082 }
01083
01085 inline bool isIntegerNonBinary(int colIndex) const {
01086 return solver_->isIntegerNonBinary(colIndex);
01087 }
01088
01090 inline bool isFreeBinary(int colIndex) const {
01091 return solver_->isFreeBinary(colIndex) ;
01092 }
01093
01095 inline const CoinPackedMatrix * getMatrixByRow() const {
01096 return solver_->getMatrixByRow();
01097 }
01098
01100 inline const CoinPackedMatrix * getMatrixByCol() const {
01101 return solver_->getMatrixByCol();
01102 }
01103
01105 inline double getInfinity() const {
01106 return solver_->getInfinity();
01107 }
01109 inline const double * getCbcColLower() const {
01110 return cbcColLower_;
01111 }
01113 inline const double * getCbcColUpper() const {
01114 return cbcColUpper_;
01115 }
01117 inline const double * getCbcRowLower() const {
01118 return cbcRowLower_;
01119 }
01121 inline const double * getCbcRowUpper() const {
01122 return cbcRowUpper_;
01123 }
01125 inline const double * getCbcColSolution() const {
01126 return cbcColSolution_;
01127 }
01129 inline const double * getCbcRowPrice() const {
01130 return cbcRowPrice_;
01131 }
01133 inline const double * getCbcReducedCost() const {
01134 return cbcReducedCost_;
01135 }
01137 inline const double * getCbcRowActivity() const {
01138 return cbcRowActivity_;
01139 }
01141
01142
01145
01146 inline double * continuousSolution() const {
01147 return continuousSolution_;
01148 }
01153 inline int * usedInSolution() const {
01154 return usedInSolution_;
01155 }
01157 void incrementUsed(const double * solution);
01159 void setBestSolution(CBC_Message how,
01160 double & objectiveValue, const double *solution,
01161 int fixVariables = 0);
01163 void setBestObjectiveValue( double objectiveValue);
01165 CbcEventHandler::CbcAction dealWithEventHandler(CbcEventHandler::CbcEvent event,
01166 double objValue,
01167 const double * solution);
01168
01175 double checkSolution(double cutoff, double * solution,
01176 int fixVariables, double originalObjValue);
01183 bool feasibleSolution(int & numberIntegerInfeasibilities,
01184 int & numberObjectInfeasibilities) const;
01185
01191 inline double * currentSolution() const {
01192 return currentSolution_;
01193 }
01197 inline const double * testSolution() const {
01198 return testSolution_;
01199 }
01200 inline void setTestSolution(const double * solution) {
01201 testSolution_ = solution;
01202 }
01204 void reserveCurrentSolution(const double * solution = NULL);
01205
01207 inline const double * getColSolution() const {
01208 return solver_->getColSolution();
01209 }
01210
01212 inline const double * getRowPrice() const {
01213 return solver_->getRowPrice();
01214 }
01215
01217 inline const double * getReducedCost() const {
01218 return solver_->getReducedCost();
01219 }
01220
01222 inline const double * getRowActivity() const {
01223 return solver_->getRowActivity();
01224 }
01225
01227 inline double getCurrentObjValue() const {
01228 return dblParam_[CbcCurrentObjectiveValue];
01229 }
01231 inline double getCurrentMinimizationObjValue() const {
01232 return dblParam_[CbcCurrentMinimizationObjectiveValue];
01233 }
01234
01236 inline double getMinimizationObjValue() const {
01237 return bestObjective_;
01238 }
01240 inline void setMinimizationObjValue(double value) {
01241 bestObjective_ = value;
01242 }
01243
01245 inline double getObjValue() const {
01246 return bestObjective_ * solver_->getObjSense() ;
01247 }
01253 double getBestPossibleObjValue() const;
01255 inline void setObjValue(double value) {
01256 bestObjective_ = value * solver_->getObjSense() ;
01257 }
01259 inline double getSolverObjValue() const {
01260 return solver_->getObjValue() * solver_->getObjSense() ;
01261 }
01262
01269 inline double * bestSolution() const {
01270 return bestSolution_;
01271 }
01278 void setBestSolution(const double * solution, int numberColumns,
01279 double objectiveValue, bool check = false);
01280
01282 inline int getSolutionCount() const {
01283 return numberSolutions_;
01284 }
01285
01287 inline void setSolutionCount(int value) {
01288 numberSolutions_ = value;
01289 }
01291 int numberSavedSolutions() const;
01293 inline int maximumSavedSolutions() const {
01294 return maximumSavedSolutions_;
01295 }
01297 void setMaximumSavedSolutions(int value);
01299 const double * savedSolution(int which) const;
01301 double savedSolutionObjective(int which) const;
01302
01311 inline int phase() const {
01312 return phase_;
01313 }
01314
01316 inline int getNumberHeuristicSolutions() const {
01317 return numberHeuristicSolutions_;
01318 }
01320 inline void setNumberHeuristicSolutions(int value) {
01321 numberHeuristicSolutions_ = value;
01322 }
01323
01325 inline void setObjSense(double s) {
01326 dblParam_[CbcOptimizationDirection] = s;
01327 solver_->setObjSense(s);
01328 }
01329
01331 inline double getContinuousObjective() const {
01332 return originalContinuousObjective_;
01333 }
01334 inline void setContinuousObjective(double value) {
01335 originalContinuousObjective_ = value;
01336 }
01338 inline int getContinuousInfeasibilities() const {
01339 return continuousInfeasibilities_;
01340 }
01341 inline void setContinuousInfeasibilities(int value) {
01342 continuousInfeasibilities_ = value;
01343 }
01345 inline double rootObjectiveAfterCuts() const {
01346 return continuousObjective_;
01347 }
01349 inline double sumChangeObjective() const {
01350 return sumChangeObjective1_;
01351 }
01354 inline int numberGlobalViolations() const {
01355 return numberGlobalViolations_;
01356 }
01357 inline void clearNumberGlobalViolations() {
01358 numberGlobalViolations_ = 0;
01359 }
01361 inline bool resolveAfterTakeOffCuts() const {
01362 return resolveAfterTakeOffCuts_;
01363 }
01364 inline void setResolveAfterTakeOffCuts(bool yesNo) {
01365 resolveAfterTakeOffCuts_ = yesNo;
01366 }
01368 inline int maximumRows() const {
01369 return maximumRows_;
01370 }
01372 inline CoinWarmStartBasis & workingBasis() {
01373 return workingBasis_;
01374 }
01376 inline int getStopNumberIterations() const {
01377 return stopNumberIterations_;
01378 }
01380 inline void setStopNumberIterations(int value) {
01381 stopNumberIterations_ = value;
01382 }
01384
01387
01388 inline CbcCompareBase * nodeComparison() const {
01389 return nodeCompare_;
01390 }
01391 void setNodeComparison(CbcCompareBase * compare);
01392 void setNodeComparison(CbcCompareBase & compare);
01394
01397
01398 inline CbcFeasibilityBase * problemFeasibility() const {
01399 return problemFeasibility_;
01400 }
01401 void setProblemFeasibility(CbcFeasibilityBase * feasibility);
01402 void setProblemFeasibility(CbcFeasibilityBase & feasibility);
01404
01407
01408 inline CbcTree * tree() const {
01409 return tree_;
01410 }
01412 void passInTreeHandler(CbcTree & tree);
01416 void passInSubTreeModel(CbcModel & model);
01421 CbcModel * subTreeModel(OsiSolverInterface * solver = NULL) const;
01423 inline int numberStoppedSubTrees() const {
01424 return numberStoppedSubTrees_;
01425 }
01427 inline void incrementSubTreeStopped() {
01428 numberStoppedSubTrees_++;
01429 }
01435 inline int typePresolve() const {
01436 return presolve_;
01437 }
01438 inline void setTypePresolve(int value) {
01439 presolve_ = value;
01440 }
01441
01443
01449
01451 inline CbcBranchDecision * branchingMethod() const {
01452 return branchingMethod_;
01453 }
01455 inline void setBranchingMethod(CbcBranchDecision * method) {
01456 delete branchingMethod_;
01457 branchingMethod_ = method->clone();
01458 }
01463 inline void setBranchingMethod(CbcBranchDecision & method) {
01464 delete branchingMethod_;
01465 branchingMethod_ = method.clone();
01466 }
01468 inline CbcCutModifier * cutModifier() const {
01469 return cutModifier_;
01470 }
01472 void setCutModifier(CbcCutModifier * modifier);
01477 void setCutModifier(CbcCutModifier & modifier);
01479
01482
01489 inline int stateOfSearch() const {
01490 return stateOfSearch_;
01491 }
01492 inline void setStateOfSearch(int state) {
01493 stateOfSearch_ = state;
01494 }
01496 inline int searchStrategy() const {
01497 return searchStrategy_;
01498 }
01500 inline void setSearchStrategy(int value) {
01501 searchStrategy_ = value;
01502 }
01503
01505 inline int numberCutGenerators() const {
01506 return numberCutGenerators_;
01507 }
01509 inline CbcCutGenerator ** cutGenerators() const {
01510 return generator_;
01511 }
01513 inline CbcCutGenerator * cutGenerator(int i) const {
01514 return generator_[i];
01515 }
01517 inline CbcCutGenerator * virginCutGenerator(int i) const {
01518 return virginGenerator_[i];
01519 }
01528 void addCutGenerator(CglCutGenerator * generator,
01529 int howOften = 1, const char * name = NULL,
01530 bool normal = true, bool atSolution = false,
01531 bool infeasible = false, int howOftenInSub = -100,
01532 int whatDepth = -1, int whatDepthInSub = -1);
01534
01539
01541 inline CbcStrategy * strategy() const {
01542 return strategy_;
01543 }
01545 void setStrategy(CbcStrategy & strategy);
01547 inline void setStrategy(CbcStrategy * strategy) {
01548 strategy_ = strategy;
01549 }
01551 inline CbcModel * parentModel() const {
01552 return parentModel_;
01553 }
01555 inline void setParentModel(CbcModel & parentModel) {
01556 parentModel_ = &parentModel;
01557 }
01559
01560
01567 void addHeuristic(CbcHeuristic * generator, const char *name = NULL,
01568 int before = -1);
01570 inline CbcHeuristic * heuristic(int i) const {
01571 return heuristic_[i];
01572 }
01574 inline int numberHeuristics() const {
01575 return numberHeuristics_;
01576 }
01578 inline CbcHeuristic * lastHeuristic() const {
01579 return lastHeuristic_;
01580 }
01582 inline void setLastHeuristic(CbcHeuristic * last) {
01583 lastHeuristic_ = last;
01584 }
01585
01604 void passInPriorities(const int * priorities, bool ifNotSimpleIntegers);
01605
01607 inline int priority(int sequence) const {
01608 return object_[sequence]->priority();
01609 }
01610
01615 void passInEventHandler(const CbcEventHandler *eventHandler) ;
01616
01618 inline CbcEventHandler* getEventHandler() const {
01619 return (eventHandler_) ;
01620 }
01621
01623
01633 void setApplicationData (void * appData);
01634
01636 void * getApplicationData() const;
01649 void passInSolverCharacteristics(OsiBabSolver * solverCharacteristics);
01651 inline const OsiBabSolver * solverCharacteristics() const {
01652 return solverCharacteristics_;
01653 }
01655
01656
01657
01660
01661 void passInMessageHandler(CoinMessageHandler * handler);
01663 void newLanguage(CoinMessages::Language language);
01664 inline void setLanguage(CoinMessages::Language language) {
01665 newLanguage(language);
01666 }
01668 inline CoinMessageHandler * messageHandler() const {
01669 return handler_;
01670 }
01672 inline CoinMessages & messages() {
01673 return messages_;
01674 }
01676 inline CoinMessages * messagesPointer() {
01677 return &messages_;
01678 }
01680 void setLogLevel(int value);
01682 inline int logLevel() const {
01683 return handler_->logLevel();
01684 }
01690 inline void setDefaultHandler(bool yesNo) {
01691 defaultHandler_ = yesNo;
01692 }
01694
01696
01697
01721 inline void setSpecialOptions(int value) {
01722 specialOptions_ = value;
01723 }
01725 inline int specialOptions() const {
01726 return specialOptions_;
01727 }
01729 inline bool normalSolver() const {
01730 return (specialOptions_&16) == 0;
01731 }
01746 inline void setMoreSpecialOptions(int value) {
01747 moreSpecialOptions_ = value;
01748 }
01750 inline int moreSpecialOptions() const {
01751 return moreSpecialOptions_;
01752 }
01754 inline void setUseElapsedTime(bool yesNo) {
01755 if (yesNo)
01756 moreSpecialOptions_ |= 131072;
01757 else
01758 moreSpecialOptions_ &= ~131072;
01759 }
01761 inline bool useElapsedTime() const {
01762 return (moreSpecialOptions_&131072)!=0;
01763 }
01765 #ifdef COIN_HAS_CLP
01766 void goToDantzig(int numberNodes, ClpDualRowPivot *& savePivotMethod);
01767 #endif
01769 inline bool ownObjects() const {
01770 return ownObjects_;
01771 }
01773 void checkModel();
01775
01776
01778
01779
01780 CbcModel();
01781
01783 CbcModel(const OsiSolverInterface &);
01784
01793 void assignSolver(OsiSolverInterface *&solver, bool deleteSolver = true);
01794
01806 inline void setModelOwnsSolver (bool ourSolver) {
01807 ownership_ = ourSolver ? (ownership_ | 0x80000000) : (ownership_ & (~0x80000000)) ;
01808 }
01809
01815 inline bool modelOwnsSolver () {
01816 return ((ownership_&0x80000000) != 0) ;
01817 }
01818
01822 CbcModel(const CbcModel & rhs, bool cloneHandler = false);
01823
01825 CbcModel & operator=(const CbcModel& rhs);
01826
01828 ~CbcModel ();
01829
01831 inline OsiSolverInterface * solver() const {
01832 return solver_;
01833 }
01834
01836 inline OsiSolverInterface * swapSolver(OsiSolverInterface * solver) {
01837 OsiSolverInterface * returnSolver = solver_;
01838 solver_ = solver;
01839 return returnSolver;
01840 }
01841
01843 inline OsiSolverInterface * continuousSolver() const {
01844 return continuousSolver_;
01845 }
01846
01848 inline void createContinuousSolver() {
01849 continuousSolver_ = solver_->clone();
01850 }
01852 inline void clearContinuousSolver() {
01853 delete continuousSolver_;
01854 continuousSolver_ = NULL;
01855 }
01856
01858 inline OsiSolverInterface * referenceSolver() const {
01859 return referenceSolver_;
01860 }
01861
01863 void saveReferenceSolver();
01864
01870 void resetToReferenceSolver();
01871
01873 void gutsOfDestructor();
01876 void gutsOfDestructor2();
01879 void resetModel();
01885 void gutsOfCopy(const CbcModel & rhs, int mode = 0);
01887 void moveInfo(const CbcModel & rhs);
01889
01891
01892
01893 CbcThread * masterThread() const {
01894 return masterThread_;
01895 }
01897 CbcNodeInfo ** walkback() const {
01898 return walkback_;
01899 }
01901 inline int getNumberThreads() const {
01902 return numberThreads_;
01903 }
01905 inline void setNumberThreads(int value) {
01906 numberThreads_ = value;
01907 }
01909 inline int getThreadMode() const {
01910 return threadMode_;
01911 }
01921 inline void setThreadMode(int value) {
01922 threadMode_ = value;
01923 }
01930 inline int parallelMode() const {
01931 if (!numberThreads_) {
01932 if ((threadMode_&1) == 0)
01933 return 0;
01934 else
01935 return -1;
01936 return 0;
01937 } else {
01938 if ((threadMode_&1) == 0)
01939 return 1;
01940 else
01941 return -2;
01942 }
01943 }
01946 bool isLocked() const;
01947 #ifdef CBC_THREAD
01948
01952 void lockThread();
01956 void unlockThread();
01957 #else
01958 inline void lockThread() {}
01959 inline void unlockThread() {}
01960 #endif
01961
01968 void setInfoInChild(int type, CbcThread * info);
01975 void moveToModel(CbcModel * baseModel, int mode);
01977 int splitModel(int numberModels, CbcModel ** model,
01978 int numberNodes);
01980 void startSplitModel(int numberIterations);
01982 void mergeModels(int numberModel, CbcModel ** model,
01983 int numberNodes);
01985
01987
01988
01989 int getNodeCount2() const {
01990 return numberNodes2_;
01991 }
01993 void setPointers(const OsiSolverInterface * solver);
01999 int reducedCostFix() ;
02003 void synchronizeHandlers(int makeDefault);
02005 void saveExtraSolution(const double * solution, double objectiveValue);
02007 void saveBestSolution(const double * solution, double objectiveValue);
02009 void deleteSolutions();
02011 int resolve(OsiSolverInterface * solver);
02012 #ifdef CLP_RESOLVE
02014 int resolveClp(OsiClpSolverInterface * solver, int type);
02015 #endif
02016
02020 int chooseBranch(CbcNode * & newNode, int numberPassesLeft,
02021 CbcNode * oldNode, OsiCuts & cuts,
02022 bool & resolved, CoinWarmStartBasis *lastws,
02023 const double * lowerBefore, const double * upperBefore,
02024 OsiSolverBranch * & branches);
02025 int chooseBranch(CbcNode * newNode, int numberPassesLeft, bool & resolved);
02026
02033 CoinWarmStartBasis *getEmptyBasis(int ns = 0, int na = 0) const ;
02034
02046 int takeOffCuts(OsiCuts &cuts,
02047 bool allowResolve, OsiCuts * saveCuts,
02048 int numberNewCuts = 0, const OsiRowCut ** newCuts = NULL) ;
02049
02063 int addCuts(CbcNode * node, CoinWarmStartBasis *&lastws, bool canFix);
02064
02081 bool addCuts1(CbcNode * node, CoinWarmStartBasis *&lastws);
02085 void previousBounds (CbcNode * node, CbcNodeInfo * where, int iColumn,
02086 double & lower, double & upper, int force);
02091 void setObjectiveValue(CbcNode * thisNode, const CbcNode * parentNode) const;
02092
02096 void convertToDynamic();
02098 void synchronizeNumberBeforeTrust(int type = 0);
02100 void zapIntegerInformation(bool leaveObjects = true);
02102 int cliquePseudoCosts(int doStatistics);
02104 void pseudoShadow(int type);
02111 void fillPseudoCosts(double * downCosts, double * upCosts,
02112 int * priority = NULL,
02113 int * numberDown = NULL, int * numberUp = NULL,
02114 int * numberDownInfeasible = NULL,
02115 int * numberUpInfeasible = NULL) const;
02121 void doHeuristicsAtRoot(int deleteHeuristicsAfterwards = 0);
02123 void adjustHeuristics();
02125 inline const double * hotstartSolution() const {
02126 return hotstartSolution_;
02127 }
02129 inline const int * hotstartPriorities() const {
02130 return hotstartPriorities_;
02131 }
02132
02134 inline CbcCountRowCut ** addedCuts() const {
02135 return addedCuts_;
02136 }
02138 inline int currentNumberCuts() const {
02139 return currentNumberCuts_;
02140 }
02142 inline OsiCuts * globalCuts() {
02143 return &globalCuts_;
02144 }
02146 void setNextRowCut(const OsiRowCut & cut);
02148 inline CbcNode * currentNode() const {
02149 return currentNode_;
02150 }
02152 inline CglTreeProbingInfo * probingInfo() const {
02153 return probingInfo_;
02154 }
02156 inline CoinThreadRandom * randomNumberGenerator() {
02157 return &randomNumberGenerator_;
02158 }
02160 inline void setNumberStrongIterations(int number) {
02161 numberStrongIterations_ = number;
02162 }
02164 inline int numberStrongIterations() const {
02165 return numberStrongIterations_;
02166 }
02168 inline int maximumNumberIterations() const {
02169 return maximumNumberIterations_;
02170 }
02172 inline void setMaximumNumberIterations(int value) {
02173 maximumNumberIterations_ = value;
02174 }
02175 # ifdef COIN_HAS_CLP
02177 inline void setFastNodeDepth(int value) {
02178 fastNodeDepth_ = value;
02179 }
02181 inline int fastNodeDepth() const {
02182 return fastNodeDepth_;
02183 }
02185 inline int continuousPriority() const {
02186 return continuousPriority_;
02187 }
02189 inline void setContinuousPriority(int value) {
02190 continuousPriority_ = value;
02191 }
02192 inline void incrementExtra(int nodes, int iterations) {
02193 numberExtraNodes_ += nodes;
02194 numberExtraIterations_ += iterations;
02195 }
02196 #endif
02198 inline int numberExtraIterations() const {
02199 return numberExtraIterations_;
02200 }
02202 void incrementStrongInfo(int numberTimes, int numberIterations,
02203 int numberFixed, bool ifInfeasible);
02205 inline const int * strongInfo() const {
02206 return strongInfo_;
02207 }
02208
02210 inline int * mutableStrongInfo() {
02211 return strongInfo_;
02212 }
02214 CglStored * storedRowCuts() const {
02215 return storedRowCuts_;
02216 }
02218 void setStoredRowCuts(CglStored * cuts) {
02219 storedRowCuts_ = cuts;
02220 }
02222 inline bool allDynamic () const {
02223 return ((ownership_&0x40000000) != 0) ;
02224 }
02226 void generateCpp( FILE * fp, int options);
02228 OsiBranchingInformation usefulInformation() const;
02235 inline void setBestSolutionBasis(const CoinWarmStartBasis & bestSolutionBasis) {
02236 bestSolutionBasis_ = bestSolutionBasis;
02237 }
02239 void redoWalkBack();
02241
02242
02243
02244 private:
02246
02247
02249 OsiSolverInterface * solver_;
02250
02256 unsigned int ownership_ ;
02257
02259 OsiSolverInterface * continuousSolver_;
02260
02262 OsiSolverInterface * referenceSolver_;
02263
02265 CoinMessageHandler * handler_;
02266
02272 bool defaultHandler_;
02273
02275 CoinMessages messages_;
02276
02278 int intParam_[CbcLastIntParam];
02279
02281 double dblParam_[CbcLastDblParam];
02282
02291 mutable CoinWarmStart *emptyWarmStart_ ;
02292
02294 double bestObjective_;
02296 double bestPossibleObjective_;
02298 double sumChangeObjective1_;
02300 double sumChangeObjective2_;
02301
02303 double * bestSolution_;
02305 double ** savedSolutions_;
02306
02311 double * currentSolution_;
02315 mutable const double * testSolution_;
02322 CoinWarmStartBasis bestSolutionBasis_ ;
02324 OsiCuts globalCuts_;
02325
02327 double minimumDrop_;
02329 int numberSolutions_;
02331 int numberSavedSolutions_;
02333 int maximumSavedSolutions_;
02340 int stateOfSearch_;
02342 int whenCuts_;
02344 double * hotstartSolution_;
02346 int * hotstartPriorities_;
02348 int numberHeuristicSolutions_;
02350 int numberNodes_;
02354 int numberNodes2_;
02356 int numberIterations_;
02358 int numberSolves_;
02360 int status_;
02371 int secondaryStatus_;
02373 int numberIntegers_;
02375 int numberRowsAtContinuous_;
02377 int maximumNumberCuts_;
02386 int phase_;
02387
02389 int currentNumberCuts_;
02390
02395 int maximumDepth_;
02401 CbcNodeInfo ** walkback_;
02402 CbcNodeInfo ** lastNodeInfo_;
02403 const OsiRowCut ** lastCut_;
02404 int lastDepth_;
02405 int lastNumberCuts2_;
02406 int maximumCuts_;
02407 int * lastNumberCuts_;
02408
02416 CbcCountRowCut ** addedCuts_;
02417
02421 OsiRowCut * nextRowCut_;
02422
02424 CbcNode * currentNode_;
02425
02427 int * integerVariable_;
02429 char * integerInfo_;
02431 double * continuousSolution_;
02433 int * usedInSolution_;
02457 int specialOptions_;
02472 int moreSpecialOptions_;
02474 CbcCompareBase * nodeCompare_;
02476 CbcFeasibilityBase * problemFeasibility_;
02478 CbcTree * tree_;
02480 CbcModel * subTreeModel_;
02482 int numberStoppedSubTrees_;
02484 CbcBranchDecision * branchingMethod_;
02486 CbcCutModifier * cutModifier_;
02488 CbcStrategy * strategy_;
02490 CbcModel * parentModel_;
02496
02497 const double * cbcColLower_;
02499 const double * cbcColUpper_;
02501 const double * cbcRowLower_;
02503 const double * cbcRowUpper_;
02505 const double * cbcColSolution_;
02507 const double * cbcRowPrice_;
02509 const double * cbcReducedCost_;
02511 const double * cbcRowActivity_;
02513 void * appData_;
02515 int presolve_;
02519 int numberStrong_;
02525 int numberBeforeTrust_;
02529 int numberPenalties_;
02531 int stopNumberIterations_;
02534 double penaltyScaleFactor_;
02536 int numberAnalyzeIterations_;
02538 double * analyzeResults_;
02540 int numberInfeasibleNodes_;
02547 int problemType_;
02549 int printFrequency_;
02551 int numberCutGenerators_;
02552
02553 CbcCutGenerator ** generator_;
02554
02555 CbcCutGenerator ** virginGenerator_;
02557 int numberHeuristics_;
02559 CbcHeuristic ** heuristic_;
02561 CbcHeuristic * lastHeuristic_;
02563 int fastNodeDepth_;
02565 # ifdef CBC_ONLY_CLP
02566 ClpEventHandler *eventHandler_ ;
02567 # else
02568 CbcEventHandler *eventHandler_ ;
02569 # endif
02570
02572 int numberObjects_;
02573
02584 OsiObject ** object_;
02586 bool ownObjects_;
02587
02589 int * originalColumns_;
02591 int howOftenGlobalScan_;
02594 int numberGlobalViolations_;
02596 int numberExtraIterations_;
02598 int numberExtraNodes_;
02602 double continuousObjective_;
02605 double originalContinuousObjective_;
02607 int continuousInfeasibilities_;
02609 int maximumCutPassesAtRoot_;
02611 int maximumCutPasses_;
02613 int preferredWay_;
02615 int currentPassNumber_;
02617 int maximumWhich_;
02619 int maximumRows_;
02621 int currentDepth_;
02623 mutable CoinThreadRandom randomNumberGenerator_;
02625 CoinWarmStartBasis workingBasis_;
02627 int * whichGenerator_;
02629 int maximumStatistics_;
02631 CbcStatistics ** statistics_;
02633 int maximumDepthActual_;
02635 double numberDJFixed_;
02637 CglTreeProbingInfo * probingInfo_;
02639 int numberFixedAtRoot_;
02641 int numberFixedNow_;
02643 bool stoppedOnGap_;
02645 mutable bool eventHappened_;
02647 int numberLongStrong_;
02649 int numberOldActiveCuts_;
02651 int numberNewCuts_;
02653 int searchStrategy_;
02655 int numberStrongIterations_;
02658 int strongInfo_[7];
02665 OsiBabSolver * solverCharacteristics_;
02667 bool resolveAfterTakeOffCuts_;
02669 int maximumNumberIterations_;
02671 int continuousPriority_;
02673 int numberUpdateItems_;
02675 int maximumNumberUpdateItems_;
02677 CbcObjectUpdateData * updateItems_;
02679 CglStored * storedRowCuts_;
02687 int numberThreads_;
02695 int threadMode_;
02697 CbcBaseModel * master_;
02699 CbcThread * masterThread_;
02701 };
02703 void getIntegerInformation(const OsiObject * object, double & originalLower,
02704 double & originalUpper) ;
02705
02706
02707 class OsiClpSolverInterface;
02708 int CbcMain (int argc, const char *argv[], OsiClpSolverInterface & solver, CbcModel ** babSolver);
02709 int CbcMain (int argc, const char *argv[], CbcModel & babSolver);
02710
02711 int callCbc(const char * input2, OsiClpSolverInterface& solver1);
02712 int callCbc(const char * input2);
02713 int callCbc(const std::string input2, OsiClpSolverInterface& solver1);
02714 int callCbc(const std::string input2) ;
02715
02716 void CbcMain0 (CbcModel & babSolver);
02717 int CbcMain1 (int argc, const char *argv[], CbcModel & babSolver);
02718
02719 int callCbc(const char * input2, CbcModel & babSolver);
02720 int callCbc(const std::string input2, CbcModel & babSolver);
02721
02722 int callCbc1(const char * input2, CbcModel & babSolver);
02723 int callCbc1(const std::string input2, CbcModel & babSolver);
02724
02725 int callCbc1(const char * input2, CbcModel & babSolver, int (CbcModel * currentSolver, int whereFrom));
02726 int callCbc1(const std::string input2, CbcModel & babSolver, int (CbcModel * currentSolver, int whereFrom));
02727 int CbcMain1 (int argc, const char *argv[], CbcModel & babSolver, int (CbcModel * currentSolver, int whereFrom));
02728
02729 void setCutAndHeuristicOptions(CbcModel & model);
02730 #endif
02731