|
Blis 0.94
|
This class implements maximum infeasibility branching. More...
#include <BlisBranchStrategyBilevel.h>
Inheritance diagram for BlisBranchStrategyBilevel:
Collaboration diagram for BlisBranchStrategyBilevel:Additional Inherited Members | |
Protected Attributes inherited from BcpsBranchStrategy | |
| int | type_ |
| BcpsModel * | model_ |
| int | numBranchObjects_ |
| BcpsBranchObject ** | branchObjects_ |
| BcpsBranchObject * | bestBranchObject_ |
| double | bestChangeUp_ |
| int | bestNumberUp_ |
| double | bestChangeDown_ |
| int | bestNumberDown_ |
This class implements maximum infeasibility branching.
Definition at line 32 of file BlisBranchStrategyBilevel.h.
|
inline |
Bilevel Constructor.
Definition at line 42 of file BlisBranchStrategyBilevel.h.
|
inline |
Bilevel Constructor.
Definition at line 47 of file BlisBranchStrategyBilevel.h.
|
inlinevirtual |
Destructor.
Definition at line 52 of file BlisBranchStrategyBilevel.h.
| BlisBranchStrategyBilevel::BlisBranchStrategyBilevel | ( | const BlisBranchStrategyBilevel & | ) |
Copy constructor.
|
inlinevirtual |
Clone a brancing strategy.
Implements BcpsBranchStrategy.
Definition at line 58 of file BlisBranchStrategyBilevel.h.
|
virtual |
Create a set of candidate branching objects.
Reimplemented from BcpsBranchStrategy.
|
virtual |
Compare branching object thisOne to bestSoFar.
If thisOne is better than bestObject, return branching direction(1 or -1), otherwise return 0. If bestSorFar is NULL, then always return branching direction(1 or -1).
Implements BcpsBranchStrategy.