Ignore:
Timestamp:
Oct 20, 2006 3:59:21 PM (13 years ago)
Author:
forrest
Message:

for osi methods

File:
1 edited

Legend:

Unmodified
Added
Removed
  • branches/devel/Cbc/src/CbcHeuristicFPump.hpp

    r441 r463  
    7777  inline double relativeIncrement() const
    7878  { return relativeIncrement_;};
     79  /// Set initial weight (default 0.0 == off)
     80  inline void setInitialWeight(double value)
     81  { initialWeight_ = value;};
     82  /// Get initial weight (default 0.0 == off)
     83  inline double initialWeight() const
     84  { return initialWeight_;};
     85  /// Set weight factor (default 0.1)
     86  inline void setWeightFactor(double value)
     87  { weightFactor_ = value;};
     88  /// Get weight factor (default 0.1)
     89  inline double weightFactor() const
     90  { return weightFactor_;};
    7991  /// Set maximum passes (default 100)
    8092  inline void setMaximumPasses(int value)
     
    117129  /// If positive carry on after solution expecting gain of at least this times objective
    118130  double relativeIncrement_;
     131  /// Initial weight for true objective
     132  double initialWeight_;
     133  /// factor for decreasing weight
     134  double weightFactor_;
    119135  /// Maximum number of passes
    120136  int maximumPasses_;
     
    128144       2 - reuse solves, do not accumulate integer solutions for local search
    129145       3 - reuse solves, accumulate integer solutions for local search
     146       If we add 4 then use second form of problem (with extra rows and variables)
    130147  */
    131148  int accumulate_;
     
    141158  */
    142159  int rounds(double * solution, const double * objective,
     160             int numberIntegers, const int * integerVariable,
    143161             bool roundExpensive=false,
    144162             double downValue=0.5, int *flip=0);
Note: See TracChangeset for help on using the changeset viewer.