bbBranch(OsiBranchingInformation &brInfo, BCP_vec< BCP_lp_branching_object * > &cands) | BM_lp | |
bestSbResult_ | BM_lp | [private] |
bm_buf | BM_lp | [private] |
BM_lp() | BM_lp | |
bm_stats | BM_lp | [private] |
bonmin_ | BM_lp | [private] |
clear_SB_results() | BM_lp | |
collect_branch_data(OsiBranchingInformation &branchInfo, OsiSolverInterface *solver, const int branchNum, BM_BranchData *branchData) | BM_lp | |
compute_lower_bound(const double old_lower_bound, const BCP_lp_result &lpres, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts) | BM_lp | [virtual] |
cuts_ | BM_lp | [private] |
cuts_to_rows(const BCP_vec< BCP_var * > &vars, BCP_vec< BCP_cut * > &cuts, BCP_vec< BCP_row * > &rows, const BCP_lp_result &lpres, BCP_object_origin origin, bool allow_multiple) | BM_lp | [virtual] |
do_distributed_SB(OsiBranchingInformation &branchInfo, OsiSolverInterface *solver, const CoinWarmStart *cws, const int branchNum, const int *pids, const int pidNum) | BM_lp | |
feasInd_ | BM_lp | [private] |
feasNum_ | BM_lp | [private] |
feasUseful_ | BM_lp | [private] |
generate_cuts_in_lp(const BCP_lp_result &lpres, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts, BCP_vec< BCP_cut * > &new_cuts, BCP_vec< BCP_row * > &new_rows) | BM_lp | [virtual] |
hybridBranch() | BM_lp | |
in_strong | BM_lp | [private] |
infInd_ | BM_lp | [private] |
infNum_ | BM_lp | [private] |
infUseful_ | BM_lp | [private] |
initialize_new_search_tree_node(const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts, const BCP_vec< BCP_obj_status > &vs, const BCP_vec< BCP_obj_status > &cs, BCP_vec< int > &var_changed_pos, BCP_vec< double > &var_new_bd, BCP_vec< int > &cut_changed_pos, BCP_vec< double > &cut_new_bd) | BM_lp | [virtual] |
initialize_solver_interface() | BM_lp | [virtual] |
integerTolerance_ | BM_lp | [private] |
ipopt_file_content | BM_lp | [private] |
isBranchFathomable(int status, double obj) | BM_lp | |
load_problem(OsiSolverInterface &osi, BCP_problem_core *core, BCP_var_set &vars, BCP_cut_set &cuts) | BM_lp | [virtual] |
modify_lp_parameters(OsiSolverInterface *lp, bool in_strong_branching) | BM_lp | [virtual] |
nl_file_content | BM_lp | [private] |
node_start_time | BM_lp | [private] |
numNlpFailed() | BM_lp | [inline] |
numNlpFailed_ | BM_lp | [private] |
objInd_ | BM_lp | [private] |
objNum_ | BM_lp | [private] |
par | BM_lp | [private] |
process_message(BCP_buffer &buf) | BM_lp | [virtual] |
process_SB_results(OsiBranchingInformation &branchInfo, OsiSolverInterface *solver, Bonmin::BonChooseVariable *choose, OsiBranchingObject *&branchObject) | BM_lp | |
sbResult_ | BM_lp | [private] |
select_branching_candidates(const BCP_lp_result &lpres, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts, const BCP_lp_var_pool &local_var_pool, const BCP_lp_cut_pool &local_cut_pool, BCP_vec< BCP_lp_branching_object * > &cans, bool force_branch=false) | BM_lp | [virtual] |
send_pseudo_cost_update(OsiBranchingInformation &branchInfo) | BM_lp | |
set_user_data_for_children(BCP_presolved_lp_brobj *best, const int selected) | BM_lp | [virtual] |
sort_objects(OsiBranchingInformation &branchInfo, Bonmin::BonChooseVariable *choose, int &branchNum) | BM_lp | |
test_feasibility(const BCP_lp_result &lp_result, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts) | BM_lp | [virtual] |
test_feasibility_BB(const BCP_lp_result &lp_result, const BCP_vec< BCP_var * > &vars) | BM_lp | |
test_feasibility_hybrid(const BCP_lp_result &lp_result, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts) | BM_lp | |
try_to_branch(OsiBranchingInformation &branchInfo, OsiSolverInterface *solver, Bonmin::BonChooseVariable *choose, OsiBranchingObject *&branchObject, bool allowVarFix) | BM_lp | |
unpack_module_data(BCP_buffer &buf) | BM_lp | [virtual] |
unpack_pseudo_costs(BCP_buffer &buf) | BM_lp | |
~BM_lp() | BM_lp | [virtual] |