CglLandPUtils.hpp

Go to the documentation of this file.

// Copyright (C) 2005-2009, Pierre Bonami and others.  All Rights Reserved.
// Author:   Pierre Bonami
//           LIF
//           CNRS, Aix-Marseille Universites
// Date:     02/23/08
//
// $Id: CglLandPUtils.hpp 1122 2013-04-06 20:39:53Z stefan $
//
// This code is licensed under the terms of the Eclipse Public License (EPL).
//---------------------------------------------------------------------------

#ifndef CglLandPUtils_H
#define CglLandPUtils_H
#include "CglLandPTabRow.hpp"

class CoinRelFltEq;
class OsiRowCut;
class OsiCuts;
#include <vector>
#include <cmath>

namespace LAP
{
double normCoef(TabRow &row, int ncols, const int * nonBasics);
void scale(OsiRowCut &cut);
void scale(OsiRowCut &cut, double norma);
void modularizeRow(TabRow & row, const bool * integerVar);


inline double intersectionCutCoef(double alpha_i, double beta)
{
    if (alpha_i>0) return alpha_i* (1 - beta);
    else return -alpha_i * beta;// (1 - beta);
}

inline double modularizedCoef(double alpha, double beta)
{
    double f_i = alpha - floor(alpha);
    if (f_i <= beta)
        return f_i;
    else
        return f_i - 1;
}

inline bool int_val(double value, double tol)
{
    return fabs( floor( value + 0.5 ) - value ) < tol;
}


struct Cuts
{
    Cuts():  numberCuts_(0), cuts_(0)
    {
    }
    int insertAll(OsiCuts & cs, CoinRelFltEq& eq);
    ~Cuts() {}
    OsiRowCut * rowCut(unsigned int i)
    {
        return cuts_[i];
    }
    const OsiRowCut * rowCut(unsigned int i) const
    {
        return cuts_[i];
    }
    void insert(int i, OsiRowCut * cut);
    int numberCuts()
    {
        return numberCuts_;
    }
    void resize(unsigned int i)
    {
        cuts_.resize(i, reinterpret_cast<OsiRowCut *> (NULL));
    }
private:
    int numberCuts_;
    std::vector<OsiRowCut *> cuts_;
};

}
#endif