source: trunk/Cbc/src/CbcStrategy.cpp @ 535

Last change on this file since 535 was 535, checked in by forrest, 13 years ago

messages

  • Property svn:eol-style set to native
  • Property svn:keywords set to Author Date Id Revision
File size: 22.9 KB
Line 
1// Copyright (C) 2005, International Business Machines
2// Corporation and others.  All Rights Reserved.
3#if defined(_MSC_VER)
4// Turn off compiler warning about long names
5#  pragma warning(disable:4786)
6#endif
7
8#include "CbcConfig.h"
9
10#include <cassert>
11#include <cmath>
12#include <cfloat>
13
14#include "OsiSolverInterface.hpp"
15#ifdef COIN_HAS_CLP
16#include "OsiClpSolverInterface.hpp"
17#endif
18#include "CbcModel.hpp"
19#include "CbcMessage.hpp"
20#include "CbcStrategy.hpp"
21#include "CbcCutGenerator.hpp"
22#include "CbcBranchActual.hpp"
23#include "CbcNode.hpp"
24#include "CoinWarmStart.hpp"
25#include "CglPreProcess.hpp"
26// Cuts
27
28#include "CglGomory.hpp"
29#include "CglProbing.hpp"
30#include "CglKnapsackCover.hpp"
31#include "CglOddHole.hpp"
32#include "CglClique.hpp"
33#include "CglFlowCover.hpp"
34#include "CglMixedIntegerRounding2.hpp"
35
36// Heuristics
37
38#include "CbcHeuristic.hpp"
39
40// Default Constructor
41CbcStrategy::CbcStrategy() 
42  :depth_(0),
43   preProcessState_(0),
44   process_(NULL)
45{
46}
47
48// Destructor
49CbcStrategy::~CbcStrategy ()
50{
51  delete process_;
52}
53// Delete pre-processing object to save memory
54void 
55CbcStrategy::deletePreProcess()
56{ 
57  delete process_;
58  process_=NULL;
59}
60// Return a new Full node information pointer (descendant of CbcFullNodeInfo)
61CbcNodeInfo * 
62CbcStrategy::fullNodeInfo(CbcModel * model,int numberRowsAtContinuous) const
63{
64  return new CbcFullNodeInfo(model,numberRowsAtContinuous);
65}
66// Return a new Partial node information pointer (descendant of CbcPartialNodeInfo)
67CbcNodeInfo * 
68CbcStrategy::partialNodeInfo(CbcModel * model, CbcNodeInfo * parent, CbcNode * owner,
69                             int numberChangedBounds,const int * variables,
70                             const double * boundChanges,
71                             const CoinWarmStartDiff *basisDiff) const
72{
73  return new CbcPartialNodeInfo(parent, owner, numberChangedBounds, variables,
74                            boundChanges,basisDiff);
75}
76/* After a CbcModel::resolve this can return a status
77   -1 no effect
78   0 treat as optimal
79   1 as 0 but do not do any more resolves (i.e. no more cuts)
80   2 treat as infeasible
81*/
82int
83CbcStrategy::status(CbcModel * model, CbcNodeInfo * parent,int whereFrom)
84{
85  return -1;
86}
87
88// Default Constructor
89CbcStrategyDefault::CbcStrategyDefault(bool cutsOnlyAtRoot,
90                                       int numberStrong,
91                                       int numberBeforeTrust,
92                                       int printLevel)
93  :CbcStrategy(),
94   cutsOnlyAtRoot_(cutsOnlyAtRoot),
95   numberStrong_(numberStrong),
96   numberBeforeTrust_(numberBeforeTrust),
97   printLevel_(printLevel),
98   desiredPreProcess_(0),
99   preProcessPasses_(0)
100{
101}
102
103
104// Destructor
105CbcStrategyDefault::~CbcStrategyDefault ()
106{
107}
108
109// Clone
110CbcStrategy *
111CbcStrategyDefault::clone() const
112{
113  return new CbcStrategyDefault(*this);
114}
115
116// Copy constructor
117CbcStrategyDefault::CbcStrategyDefault(const CbcStrategyDefault & rhs)
118:
119  CbcStrategy(rhs),
120  cutsOnlyAtRoot_(rhs.cutsOnlyAtRoot_),
121  numberStrong_(rhs.numberStrong_),
122  numberBeforeTrust_(rhs.numberBeforeTrust_),
123  printLevel_(rhs.printLevel_),
124  desiredPreProcess_(rhs.desiredPreProcess_),
125  preProcessPasses_(rhs.preProcessPasses_)
126{
127  setNested(rhs.getNested());
128}
129
130// Setup cut generators
131void 
132CbcStrategyDefault::setupCutGenerators(CbcModel & model)
133{
134  // Set up some cut generators and defaults
135  // Probing first as gets tight bounds on continuous
136
137  CglProbing generator1;
138  generator1.setUsingObjective(true);
139  generator1.setMaxPass(1);
140  // Number of unsatisfied variables to look at
141  generator1.setMaxProbe(10);
142  // How far to follow the consequences
143  generator1.setMaxLook(10);
144  // Only look at rows with fewer than this number of elements
145  generator1.setMaxElements(200);
146  //generator1.setRowCuts(3);
147
148  CglGomory generator2;
149  // try larger limit
150  generator2.setLimit(300);
151
152  CglKnapsackCover generator3;
153
154  //CglOddHole generator4;
155  //generator4.setMinimumViolation(0.005);
156  //generator4.setMinimumViolationPer(0.00002);
157  // try larger limit
158  //generator4.setMaximumEntries(200);
159
160  CglClique generator5;
161  generator5.setStarCliqueReport(false);
162  generator5.setRowCliqueReport(false);
163
164  CglMixedIntegerRounding2 mixedGen;
165  CglFlowCover flowGen;
166 
167  // Add in generators
168  int setting = cutsOnlyAtRoot_ ? -99 : -1;
169  int numberGenerators = model.numberCutGenerators();
170  int iGenerator;
171  bool found;
172  found=false;
173  for (iGenerator=0;iGenerator<numberGenerators;iGenerator++) {
174    CglCutGenerator * generator = model.cutGenerator(iGenerator)->generator();
175    CglProbing * cgl = dynamic_cast<CglProbing *>(generator);
176    if (cgl) {
177      found=true;
178      break;
179    }
180  }
181  if (!found)
182    model.addCutGenerator(&generator1,setting,"Probing");
183  found=false;
184  for (iGenerator=0;iGenerator<numberGenerators;iGenerator++) {
185    CglCutGenerator * generator = model.cutGenerator(iGenerator)->generator();
186    CglGomory * cgl = dynamic_cast<CglGomory *>(generator);
187    if (cgl) {
188      found=true;
189      break;
190    }
191  }
192  if (!found)
193  model.addCutGenerator(&generator2,setting,"Gomory");
194  found=false;
195  for (iGenerator=0;iGenerator<numberGenerators;iGenerator++) {
196    CglCutGenerator * generator = model.cutGenerator(iGenerator)->generator();
197    CglKnapsackCover * cgl = dynamic_cast<CglKnapsackCover *>(generator);
198    if (cgl) {
199      found=true;
200      break;
201    }
202  }
203  if (!found)
204    model.addCutGenerator(&generator3,setting,"Knapsack");
205  //model.addCutGenerator(&generator4,setting,"OddHole");
206  found=false;
207  for (iGenerator=0;iGenerator<numberGenerators;iGenerator++) {
208    CglCutGenerator * generator = model.cutGenerator(iGenerator)->generator();
209    CglClique * cgl = dynamic_cast<CglClique *>(generator);
210    if (cgl) {
211      found=true;
212      break;
213    }
214  }
215  if (!found)
216    model.addCutGenerator(&generator5,setting,"Clique");
217  found=false;
218  for (iGenerator=0;iGenerator<numberGenerators;iGenerator++) {
219    CglCutGenerator * generator = model.cutGenerator(iGenerator)->generator();
220    CglFlowCover * cgl = dynamic_cast<CglFlowCover *>(generator);
221    if (cgl) {
222      found=true;
223      break;
224    }
225  }
226  if (!found)
227    model.addCutGenerator(&flowGen,setting,"FlowCover");
228  found=false;
229  for (iGenerator=0;iGenerator<numberGenerators;iGenerator++) {
230    CglCutGenerator * generator = model.cutGenerator(iGenerator)->generator();
231    CglMixedIntegerRounding2 * cgl = dynamic_cast<CglMixedIntegerRounding2 *>(generator);
232    if (cgl) {
233      found=true;
234      break;
235    }
236  }
237  if (!found)
238    model.addCutGenerator(&mixedGen,setting,"MixedIntegerRounding2");
239  // Say we want timings
240  int newNumberGenerators = model.numberCutGenerators();
241  for (iGenerator=numberGenerators;iGenerator<newNumberGenerators;iGenerator++) {
242    CbcCutGenerator * generator = model.cutGenerator(iGenerator);
243    generator->setTiming(true);
244  }
245  if (model.getNumCols()<500)
246    model.setMaximumCutPassesAtRoot(-100); // always do 100 if possible
247  else if (model.getNumCols()<5000)
248    model.setMaximumCutPassesAtRoot(100); // use minimum drop
249  else
250    model.setMaximumCutPassesAtRoot(20);
251}
252// Setup heuristics
253void 
254CbcStrategyDefault::setupHeuristics(CbcModel & model)
255{
256  // Allow rounding heuristic
257
258  CbcRounding heuristic1(model);
259  int numberHeuristics = model.numberHeuristics();
260  int iHeuristic;
261  bool found;
262  found=false;
263  for (iHeuristic=0;iHeuristic<numberHeuristics;iHeuristic++) {
264    CbcHeuristic * heuristic = model.heuristic(iHeuristic);
265    CbcRounding * cgl = dynamic_cast<CbcRounding *>(heuristic);
266    if (cgl) {
267      found=true;
268      break;
269    }
270  }
271  if (!found)
272    model.addHeuristic(&heuristic1);
273}
274// Do printing stuff
275void 
276CbcStrategyDefault::setupPrinting(CbcModel & model,int modelLogLevel)
277{
278  if (!modelLogLevel) {
279    model.solver()->setHintParam(OsiDoReducePrint,true,OsiHintTry);
280    model.messageHandler()->setLogLevel(0);
281    model.solver()->messageHandler()->setLogLevel(0);
282  } else if (modelLogLevel==1) {
283    model.solver()->setHintParam(OsiDoReducePrint,true,OsiHintTry);
284    model.messageHandler()->setLogLevel(1);
285    model.solver()->messageHandler()->setLogLevel(0);
286  } else {
287    model.messageHandler()->setLogLevel(2);
288    model.solver()->messageHandler()->setLogLevel(1);
289    model.setPrintFrequency(50);
290  }
291}
292// Other stuff e.g. strong branching
293void 
294CbcStrategyDefault::setupOther(CbcModel & model)
295{
296  // See if preprocessing wanted
297  if (desiredPreProcess_) {
298    delete process_;
299    // solver_ should have been cloned outside
300    CglPreProcess * process = new CglPreProcess();
301    // Pass in models message handler
302    process->passInMessageHandler(model.messageHandler());
303    OsiSolverInterface * solver = model.solver();
304    int logLevel = model.messageHandler()->logLevel();
305#ifdef COIN_HAS_CLP
306    OsiClpSolverInterface * clpSolver = dynamic_cast< OsiClpSolverInterface*> (solver);
307    ClpSimplex * lpSolver=NULL;
308    if (clpSolver) {
309      if (clpSolver->messageHandler()->logLevel())
310        clpSolver->messageHandler()->setLogLevel(1);
311      if (logLevel>-1)
312        clpSolver->messageHandler()->setLogLevel(CoinMin(logLevel,clpSolver->messageHandler()->logLevel()));
313      lpSolver = clpSolver->getModelPtr();
314      /// If user left factorization frequency then compute
315      lpSolver->defaultFactorizationFrequency();
316    }
317#endif
318    // Tell solver we are in Branch and Cut
319    solver->setHintParam(OsiDoInBranchAndCut,true,OsiHintDo) ;
320    // Default set of cut generators
321    CglProbing generator1;
322    generator1.setUsingObjective(true);
323    generator1.setMaxPass(3);
324    generator1.setMaxProbeRoot(solver->getNumCols());
325    generator1.setMaxElements(100);
326    generator1.setMaxLookRoot(50);
327    generator1.setRowCuts(3);
328    //generator1.messageHandler()->setLogLevel(logLevel);
329    // Not needed with pass in process->messageHandler()->setLogLevel(logLevel);
330    // Add in generators
331    process->addCutGenerator(&generator1);
332    int translate[]={9999,0,2,3};
333    OsiSolverInterface * solver2 = 
334      process->preProcessNonDefault(*solver,
335                                    translate[desiredPreProcess_],preProcessPasses_);
336    // Tell solver we are not in Branch and Cut
337    solver->setHintParam(OsiDoInBranchAndCut,false,OsiHintDo) ;
338    if (solver2)
339      solver2->setHintParam(OsiDoInBranchAndCut,false,OsiHintDo) ;
340    bool feasible=true;
341    if (!solver2) {
342      feasible = false;
343      //printf("Pre-processing says infeasible\n");
344      delete process;
345      preProcessState_=-1;
346      process_=NULL;
347    } else {
348      // now tighten bounds
349#ifdef COIN_HAS_CLP
350      if (clpSolver) {
351        // model has changed
352        solver = model.solver();
353        OsiClpSolverInterface * clpSolver = dynamic_cast< OsiClpSolverInterface*> (solver);
354        ClpSimplex * lpSolver = clpSolver->getModelPtr();
355        lpSolver->passInMessageHandler(solver->messageHandler());
356        if (lpSolver->tightenPrimalBounds()==0) {
357          lpSolver->dual();
358        } else {
359          feasible = false;
360        }
361      }
362#endif
363      if (feasible) {
364        preProcessState_=1;
365        process_=process;
366        /* Note that original solver will be kept (with false)
367           and that final solver will also be kept.
368           This is for post-processing
369        */
370        OsiSolverInterface * solver3 = solver2->clone();
371        model.assignSolver(solver3,false);
372        if (process_->numberSOS()) {
373          int numberSOS = process_->numberSOS();
374          int numberIntegers = model.numberIntegers();
375          /* model may not have created objects
376             If none then create
377             NOTE - put back to original column numbers as
378             CbcModel will pack down ALL as it doesn't know where from
379          */
380          bool someObjects = model.numberObjects()>0;
381          if (!numberIntegers||!model.numberObjects()) {
382            model.findIntegers(true);
383            numberIntegers = model.numberIntegers();
384          }
385          CbcObject ** oldObjects = model.objects();
386          // Do sets and priorities
387          CbcObject ** objects = new CbcObject * [numberSOS];
388          // set old objects to have low priority
389          int numberOldObjects = model.numberObjects();
390          int numberColumns = model.getNumCols();
391          for (int iObj = 0;iObj<numberOldObjects;iObj++) {
392            int oldPriority = oldObjects[iObj]->priority();
393            oldObjects[iObj]->setPriority(numberColumns+oldPriority);
394          }
395          const int * starts = process_->startSOS();
396          const int * which = process_->whichSOS();
397          const int * type = process_->typeSOS();
398          const double * weight = process_->weightSOS();
399          int iSOS;
400          for (iSOS =0;iSOS<numberSOS;iSOS++) {
401            int iStart = starts[iSOS];
402            int n=starts[iSOS+1]-iStart;
403            objects[iSOS] = new CbcSOS(&model,n,which+iStart,weight+iStart,
404                                       iSOS,type[iSOS]);
405            // branch on long sets first
406            objects[iSOS]->setPriority(numberColumns-n);
407          }
408          model.addObjects(numberSOS,objects);
409          for (iSOS=0;iSOS<numberSOS;iSOS++)
410            delete objects[iSOS];
411          delete [] objects;
412          if (!someObjects) {
413            // put back old column numbers
414            const int * originalColumns = process_->originalColumns();
415            // use reverse lookup to fake it
416            int n=originalColumns[numberColumns-1]+1;
417            int * fake = new int[n];
418            int i;
419            for ( i=0;i<n;i++)
420              fake[i]=-1;
421            for (i=0;i<numberColumns;i++)
422              fake[originalColumns[i]]=i;
423            for (int iObject=0;iObject<model.numberObjects();iObject++) {
424              // redo ids etc
425              model.modifiableObject(iObject)->redoSequenceEtc(&model,n,fake);
426            }
427            delete [] fake;
428          }
429        }
430      } else {
431        //printf("Pre-processing says infeasible\n");
432        delete process;
433        preProcessState_=-1;
434        process_=NULL;
435      }
436    }
437  }
438  model.setNumberStrong(numberStrong_);
439  model.setNumberBeforeTrust(numberBeforeTrust_);
440}
441// Create C++ lines to get to current state
442void 
443CbcStrategyDefault::generateCpp( FILE * fp) 
444{
445  fprintf(fp,"0#include \"CbcStrategy.hpp\"\n");
446  fprintf(fp,"3  CbcStrategyDefault strategy(%s,%d,%d,%d);\n",
447          cutsOnlyAtRoot_ ? "true" : "false",
448          numberStrong_,
449          numberBeforeTrust_,
450          printLevel_);
451  fprintf(fp,"3  strategy.setupPreProcessing(%d,%d);\n",
452          desiredPreProcess_,preProcessPasses_);
453}
454// Default Constructor
455CbcStrategyDefaultSubTree::CbcStrategyDefaultSubTree(CbcModel * parent ,
456                                                     bool cutsOnlyAtRoot,
457                                       int numberStrong,
458                                       int numberBeforeTrust,
459                                       int printLevel)
460  :CbcStrategy(),
461   parentModel_(parent),
462   cutsOnlyAtRoot_(cutsOnlyAtRoot),
463   numberStrong_(numberStrong),
464   numberBeforeTrust_(numberBeforeTrust),
465   printLevel_(printLevel)
466{
467}
468
469
470// Destructor
471CbcStrategyDefaultSubTree::~CbcStrategyDefaultSubTree ()
472{
473}
474
475// Clone
476CbcStrategy *
477CbcStrategyDefaultSubTree::clone() const
478{
479  return new CbcStrategyDefaultSubTree(*this);
480}
481
482// Copy constructor
483CbcStrategyDefaultSubTree::CbcStrategyDefaultSubTree(const CbcStrategyDefaultSubTree & rhs)
484:
485  CbcStrategy(rhs),
486  parentModel_(rhs.parentModel_),
487  cutsOnlyAtRoot_(rhs.cutsOnlyAtRoot_),
488  numberStrong_(rhs.numberStrong_),
489  numberBeforeTrust_(rhs.numberBeforeTrust_),
490  printLevel_(rhs.printLevel_)
491{
492  setNested(rhs.getNested());
493}
494
495// Setup cut generators
496void 
497CbcStrategyDefaultSubTree::setupCutGenerators(CbcModel & model)
498{
499  // Set up some cut generators and defaults
500  // Probing first as gets tight bounds on continuous
501
502  CglProbing generator1;
503  generator1.setUsingObjective(true);
504  generator1.setMaxPass(1);
505  // Number of unsatisfied variables to look at
506  generator1.setMaxProbe(10);
507  // How far to follow the consequences
508  generator1.setMaxLook(10);
509  // Only look at rows with fewer than this number of elements
510  generator1.setMaxElements(200);
511  //generator1.setRowCuts(3);
512
513  CglGomory generator2;
514  // try larger limit
515  generator2.setLimit(300);
516
517  CglKnapsackCover generator3;
518
519  //CglOddHole generator4;
520  //generator4.setMinimumViolation(0.005);
521  //generator4.setMinimumViolationPer(0.00002);
522  // try larger limit
523  //generator4.setMaximumEntries(200);
524
525  CglClique generator5;
526  generator5.setStarCliqueReport(false);
527  generator5.setRowCliqueReport(false);
528
529  CglMixedIntegerRounding2 mixedGen;
530  CglFlowCover flowGen;
531 
532  // Add in generators
533  int setting = cutsOnlyAtRoot_ ? -99 : -1;
534  int numberGenerators = model.numberCutGenerators();
535  int numberParentGenerators = parentModel_->numberCutGenerators();
536  int iGenerator;
537  bool found;
538  found=false;
539  int howOften=0;
540  for (iGenerator=0;iGenerator<numberParentGenerators;iGenerator++) {
541    CglCutGenerator * generator = parentModel_->cutGenerator(iGenerator)->generator();
542    CglProbing * cgl = dynamic_cast<CglProbing *>(generator);
543    if (cgl) {
544      found=true;
545      howOften = parentModel_->cutGenerator(iGenerator)->howOften();
546      break;
547    }
548  }
549  if (found&&howOften>=0) {
550    found=false;
551    for (iGenerator=0;iGenerator<numberGenerators;iGenerator++) {
552      CglCutGenerator * generator = model.cutGenerator(iGenerator)->generator();
553      CglProbing * cgl = dynamic_cast<CglProbing *>(generator);
554      if (cgl) {
555        found=true;
556        break;
557      }
558    }
559    if (!found)
560      model.addCutGenerator(&generator1,setting,"Probing");
561  }
562  found=false;
563  for (iGenerator=0;iGenerator<numberParentGenerators;iGenerator++) {
564    CglCutGenerator * generator = parentModel_->cutGenerator(iGenerator)->generator();
565    CglGomory * cgl = dynamic_cast<CglGomory *>(generator);
566    if (cgl) {
567      found=true;
568      howOften = parentModel_->cutGenerator(iGenerator)->howOften();
569      break;
570    }
571  }
572  if (found&&howOften>=0) {
573    found=false;
574    for (iGenerator=0;iGenerator<numberGenerators;iGenerator++) {
575      CglCutGenerator * generator = model.cutGenerator(iGenerator)->generator();
576      CglGomory * cgl = dynamic_cast<CglGomory *>(generator);
577      if (cgl) {
578        found=true;
579        break;
580      }
581    }
582    if (!found)
583      model.addCutGenerator(&generator2,setting,"Gomory");
584  }
585  found=false;
586  for (iGenerator=0;iGenerator<numberParentGenerators;iGenerator++) {
587    CglCutGenerator * generator = parentModel_->cutGenerator(iGenerator)->generator();
588    CglKnapsackCover * cgl = dynamic_cast<CglKnapsackCover *>(generator);
589    if (cgl) {
590      found=true;
591      howOften = parentModel_->cutGenerator(iGenerator)->howOften();
592      break;
593    }
594  }
595  if (found&&howOften>=0) {
596    found=false;
597    for (iGenerator=0;iGenerator<numberGenerators;iGenerator++) {
598      CglCutGenerator * generator = model.cutGenerator(iGenerator)->generator();
599      CglKnapsackCover * cgl = dynamic_cast<CglKnapsackCover *>(generator);
600      if (cgl) {
601        found=true;
602        break;
603      }
604    }
605    if (!found)
606      model.addCutGenerator(&generator3,setting,"Knapsack");
607  }
608  found=false;
609  for (iGenerator=0;iGenerator<numberParentGenerators;iGenerator++) {
610    CglCutGenerator * generator = parentModel_->cutGenerator(iGenerator)->generator();
611    CglClique * cgl = dynamic_cast<CglClique *>(generator);
612    if (cgl) {
613      found=true;
614      howOften = parentModel_->cutGenerator(iGenerator)->howOften();
615      break;
616    }
617  }
618  if (found&&howOften>=0) {
619    found=false;
620    for (iGenerator=0;iGenerator<numberGenerators;iGenerator++) {
621      CglCutGenerator * generator = model.cutGenerator(iGenerator)->generator();
622      CglClique * cgl = dynamic_cast<CglClique *>(generator);
623      if (cgl) {
624        found=true;
625        break;
626      }
627    }
628    if (!found)
629      model.addCutGenerator(&generator5,setting,"Clique");
630  }
631  found=false;
632  for (iGenerator=0;iGenerator<numberParentGenerators;iGenerator++) {
633    CglCutGenerator * generator = parentModel_->cutGenerator(iGenerator)->generator();
634    CglFlowCover * cgl = dynamic_cast<CglFlowCover *>(generator);
635    if (cgl) {
636      found=true;
637      howOften = parentModel_->cutGenerator(iGenerator)->howOften();
638      break;
639    }
640  }
641  if (found&&howOften>=0) {
642    found=false;
643    for (iGenerator=0;iGenerator<numberGenerators;iGenerator++) {
644      CglCutGenerator * generator = model.cutGenerator(iGenerator)->generator();
645      CglFlowCover * cgl = dynamic_cast<CglFlowCover *>(generator);
646      if (cgl) {
647        found=true;
648        break;
649      }
650    }
651    if (!found)
652      model.addCutGenerator(&flowGen,setting,"FlowCover");
653    found=false;
654  }
655  for (iGenerator=0;iGenerator<numberParentGenerators;iGenerator++) {
656    CglCutGenerator * generator = parentModel_->cutGenerator(iGenerator)->generator();
657    CglMixedIntegerRounding2 * cgl = dynamic_cast<CglMixedIntegerRounding2 *>(generator);
658    if (cgl) {
659      found=true;
660      howOften = parentModel_->cutGenerator(iGenerator)->howOften();
661      break;
662    }
663  }
664  if (found&&howOften>=0) {
665    found=false;
666    for (iGenerator=0;iGenerator<numberGenerators;iGenerator++) {
667      CglCutGenerator * generator = model.cutGenerator(iGenerator)->generator();
668      CglMixedIntegerRounding2 * cgl = dynamic_cast<CglMixedIntegerRounding2 *>(generator);
669      if (cgl) {
670        found=true;
671        break;
672      }
673    }
674    if (!found)
675      model.addCutGenerator(&mixedGen,setting,"MixedIntegerRounding2");
676  }
677#if 0
678  // Say we want timings
679  int newNumberGenerators = model.numberCutGenerators();
680  for (iGenerator=numberGenerators;iGenerator<newNumberGenerators;iGenerator++) {
681    CbcCutGenerator * generator = model.cutGenerator(iGenerator);
682    generator->setTiming(true);
683  }
684#endif
685  if (model.getNumCols()<500)
686    model.setMaximumCutPassesAtRoot(-100); // always do 100 if possible
687  else if (model.getNumCols()<5000)
688    model.setMaximumCutPassesAtRoot(100); // use minimum drop
689  else
690    model.setMaximumCutPassesAtRoot(20);
691}
692// Setup heuristics
693void 
694CbcStrategyDefaultSubTree::setupHeuristics(CbcModel & model)
695{
696  // Allow rounding heuristic
697
698  CbcRounding heuristic1(model);
699  int numberHeuristics = model.numberHeuristics();
700  int iHeuristic;
701  bool found;
702  found=false;
703  for (iHeuristic=0;iHeuristic<numberHeuristics;iHeuristic++) {
704    CbcHeuristic * heuristic = model.heuristic(iHeuristic);
705    CbcRounding * cgl = dynamic_cast<CbcRounding *>(heuristic);
706    if (cgl) {
707      found=true;
708      break;
709    }
710  }
711  if (!found)
712    model.addHeuristic(&heuristic1);
713}
714// Do printing stuff
715void 
716CbcStrategyDefaultSubTree::setupPrinting(CbcModel & model,int modelLogLevel)
717{
718  if (!modelLogLevel) {
719    model.solver()->setHintParam(OsiDoReducePrint,true,OsiHintTry);
720    model.messageHandler()->setLogLevel(0);
721    model.solver()->messageHandler()->setLogLevel(0);
722  } else if (modelLogLevel==1) {
723    model.solver()->setHintParam(OsiDoReducePrint,true,OsiHintTry);
724    model.messageHandler()->setLogLevel(1);
725    model.solver()->messageHandler()->setLogLevel(0);
726  } else {
727    model.messageHandler()->setLogLevel(2);
728    model.solver()->messageHandler()->setLogLevel(1);
729    model.setPrintFrequency(50);
730  }
731}
732// Other stuff e.g. strong branching
733void 
734CbcStrategyDefaultSubTree::setupOther(CbcModel & model)
735{
736  model.setNumberStrong(numberStrong_);
737  model.setNumberBeforeTrust(numberBeforeTrust_);
738}
739
740
741 
Note: See TracBrowser for help on using the repository browser.