CouenneFPpool.hpp

Go to the documentation of this file.

/* $Id: CouenneFPpool.hpp 1061 2014-02-01 19:22:28Z pbelotti $
 *
 * Name:    CouenneFPpool.hpp
 * Authors: Pietro Belotti
 *          Timo Berthold, ZIB Berlin
 * Purpose: Pool of MILP- (and why not? NLP-) feasible solutions for
 *          restart use in the Feasibility Pump and sets of solutions
 *          to be used as tabu list
 * 
 * This file is licensed under the Eclipse Public License (EPL)
 */

#ifndef CouenneFPpool_hpp
#define CouenneFPpool_hpp

#include <set>

#include "CouenneTypes.hpp"
#include "CoinFinite.hpp"
#include "CouenneProblem.hpp"

namespace Couenne {

  class CouenneProblem;
  class CouenneFeasPump;

  static enum what_to_compare {SUM_NINF = 0, SUM_INF, OBJVAL, ALL_VARS, INTEGER_VARS} comparedTerm_;

  class CouenneFPsolution {

  protected:

    CouNumber *x_;        
    int        n_;        
    int        nNLinf_;   
    int        nIinf_;    
    CouNumber  objVal_;   
    CouNumber  maxNLinf_; 
    CouNumber  maxIinf_;  


    bool copied_;   

    CouenneProblem *problem_; 

  public:

    CouenneFPsolution (CouenneProblem *p, CouNumber *x, bool copied = false); 

    CouenneFPsolution (const CouenneFPsolution &src); 

    CouenneFPsolution &operator= (const CouenneFPsolution &src); 

    ~CouenneFPsolution (); 

    const int n () const {return n_;}

    const double *x () const {return x_;}

    bool compare (const CouenneFPsolution &other, enum what_to_compare comparedTerm) const;
  };


  inline bool operator< (const CouenneFPsolution &one, 
                         const CouenneFPsolution &two)
  {return one.compare (two, comparedTerm_);}


  class compareSol {

  public:
    bool operator () (const CouenneFPsolution &one, 
                      const CouenneFPsolution &two) const;
  };


  class CouenneFPpool {

  protected:

    std::set <CouenneFPsolution, compareSol> set_;

    CouenneProblem *problem_;

  public:

    CouenneFPpool (CouenneProblem *p, enum what_to_compare c):
      problem_ (p) {comparedTerm_ = c;}

    CouenneFPpool (const CouenneFPpool &src);

    CouenneFPpool &operator= (const CouenneFPpool &src);

    std::set <CouenneFPsolution, compareSol> &Set ()
    {return set_;}

    CouenneProblem *Problem ()
    {return problem_;}

    void findClosestAndReplace (double *&sol, const double *nSol, int nvars) ;
  };
}

#endif