6#ifndef CbcBranchFollowOn2_H
7#define CbcBranchFollowOn2_H
10#include "CoinPackedMatrix.hpp"
58 int &effectiveRhs)
const;
Abstract branching object base class Now just difference with OsiBranchingObject.
virtual double infeasibility(int &preferredWay) const
Infeasibility - large is 0.5.
void setMaximumRhs(int value)
virtual CbcBranchingObject * createBranch(int way)
Creates a branching object.
int maximumRhs_
If >1 then allow cuts if effective rhs <= this.
CbcFollowOn2(const CbcFollowOn2 &)
CbcFollowOn2(CbcModel *model)
Useful constructor.
virtual int gutsOfFollowOn2(int &otherRow, int &preferredWay, int &effectiveRhs) const
As some computation is needed in more than one place - returns row.
CoinPackedMatrix matrixByRow_
Matrix by row.
int * rhs_
Possible rhs (if 0 then not possible)
CoinPackedMatrix matrix_
data Matrix
CbcFollowOn2 & operator=(const CbcFollowOn2 &rhs)
virtual void feasibleRegion()
This looks at solution and sets bounds to contain solution.
int maximumRhs() const
get and set for maximum rhws (affects cuts as branch)
virtual CbcObject * clone() const
Clone.
Simple Branch and bound class.
CbcModel * model() const
Return model.
int preferredWay() const
If -1 down always chosen first, +1 up always, 0 normal.