/usr/include/coin/CbcHeuristicVND.hpp is in coinor-libcbc-dev 2.8.12-1+b2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 | // $Id: CbcHeuristicVND.hpp 1902 2013-04-10 16:58:16Z stefan $
// Copyright (C) 2006, International Business Machines
// Corporation and others. All Rights Reserved.
// This code is licensed under the terms of the Eclipse Public License (EPL).
// edwin 12/5/09 carved out of CbcHeuristicRINS
#ifndef CbcHeuristicVND_H
#define CbcHeuristicVND_H
#include "CbcHeuristic.hpp"
/** LocalSearch class
*/
class CbcHeuristicVND : public CbcHeuristic {
public:
// Default Constructor
CbcHeuristicVND ();
/* Constructor with model - assumed before cuts
Initial version does not do Lps
*/
CbcHeuristicVND (CbcModel & model);
// Copy constructor
CbcHeuristicVND ( const CbcHeuristicVND &);
// Destructor
~CbcHeuristicVND ();
/// Clone
virtual CbcHeuristic * clone() const;
/// Assignment operator
CbcHeuristicVND & operator=(const CbcHeuristicVND& rhs);
/// Create C++ lines to get to current state
virtual void generateCpp( FILE * fp) ;
/// Resets stuff if model changes
virtual void resetModel(CbcModel * model);
/// update model (This is needed if cliques update matrix etc)
virtual void setModel(CbcModel * model);
using CbcHeuristic::solution ;
/** returns 0 if no solution, 1 if valid solution.
Sets solution values if good, sets objective value (only if good)
This does Relaxation Induced Neighborhood Search
*/
virtual int solution(double & objectiveValue,
double * newSolution);
/// This version fixes stuff and does IP
int solutionFix(double & objectiveValue,
double * newSolution,
const int * keep);
/// Sets how often to do it
inline void setHowOften(int value) {
howOften_ = value;
}
/// base solution array so we can set
inline double * baseSolution() const {
return baseSolution_;
}
protected:
// Data
/// Number of solutions so we can do something at solution
int numberSolutions_;
/// How often to do (code can change)
int howOften_;
/// Number of successes
int numberSuccesses_;
/// Number of tries
int numberTries_;
/// Node when last done
int lastNode_;
/// Step size for decomposition
int stepSize_;
int k_;
int kmax_;
int nDifferent_;
/// Base solution
double * baseSolution_;
};
#endif
|