#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. | |
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 |
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.
Definition at line 488 of file doStrongBranching.cpp.
References Couenne::t_chg_bounds::CHANGED, Couenne::t_chg_bounds::setLower(), and Couenne::t_chg_bounds::setUpper().
Referenced by Couenne::CouenneDisjCuts::getDisjunctions(), and Couenne::CouenneChooseStrong::simulateBranch().
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.
References k.
Referenced by MC_generate_shortest_path_cycles(), printCmpSol(), and Couenne::CouenneChooseStrong::simulateBranch().