#include "CoinTime.hpp"#include "BonChooseVariable.hpp"#include "CouenneChooseStrong.hpp"#include "CouenneProblem.hpp"#include "CouenneObject.hpp"#include "CouenneBranchingObject.hpp"
Include dependency graph for doStrongBranching.cpp:
Go to the source code of this file.
Functions | |
| bool | BranchingFBBT (CouenneProblem *problem, OsiObject *Object, OsiSolverInterface *solver) |
| Called from simulateBranch and from disjunctive cut generators when object is not CouenneObject and therefore needs explicit FBBT. More... | |
| double | distance (const double *p1, const double *p2, int size, double k=2.) |
| compute Euclidean distance between two points (most likely LP solutions) l_2 norm by default, but can change it by fourth parameter More... | |
Function Documentation
| bool BranchingFBBT | ( | CouenneProblem * | problem, |
| OsiObject * | Object, | ||
| OsiSolverInterface * | solver | ||
| ) |
Called from simulateBranch and from disjunctive cut generators when object is not CouenneObject and therefore needs explicit FBBT.
Called from simulateBranch when object is not CouenneObject and therefore needs explicit FBBT.
Definition at line 514 of file doStrongBranching.cpp.
| double distance | ( | const double * | p1, |
| const double * | p2, | ||
| int | size, | ||
| double | k = 2. |
||
| ) |
compute Euclidean distance between two points (most likely LP solutions) l_2 norm by default, but can change it by fourth parameter
Definition at line 33 of file doStrongBranching.cpp.
