babSolver_ | BM_lp | [private] |
BM_lp() | BM_lp | |
branching_priority_ | BM_lp | [private] |
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] |
feasChecker_ | 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] |
in_strong | 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] |
ipopt_file_content | BM_lp | [private] |
lower_bound_ | BM_lp | [private] |
modify_lp_parameters(OsiSolverInterface *lp, bool in_strong_branching) | BM_lp | [virtual] |
nl_file_content | BM_lp | [private] |
nlp | BM_lp | [private] |
numNlpFailed() | BM_lp | [inline] |
numNlpFailed_ | BM_lp | [private] |
pack_cut_algo(const BCP_cut_algo *cut, BCP_buffer &buf) | BM_lp | [inline, virtual] |
pack_feasible_solution(BCP_buffer &buf, const BCP_solution *sol) | BM_lp | [virtual] |
pack_user_data(const BCP_user_data *ud, BCP_buffer &buf) | BM_lp | [virtual] |
pack_var_algo(const BCP_var_algo *var, BCP_buffer &buf) | BM_lp | [inline, virtual] |
par | BM_lp | [private] |
primal_solution_ | BM_lp | [private] |
process_message(BCP_buffer &buf) | BM_lp | [virtual] |
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) | BM_lp | [virtual] |
set_user_data_for_children(BCP_presolved_lp_brobj *best, const int selected) | BM_lp | [virtual] |
setSosFrom(const TMINLP::SosInfo *sosinfo) | BM_lp | [private] |
sos | BM_lp | [private] |
test_feasibility(const BCP_lp_result &lp_result, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts) | BM_lp | [virtual] |
unpack_cut_algo(BCP_buffer &buf) | BM_lp | [inline, virtual] |
unpack_module_data(BCP_buffer &buf) | BM_lp | [virtual] |
unpack_user_data(BCP_buffer &buf) | BM_lp | [virtual] |
unpack_var_algo(BCP_buffer &buf) | BM_lp | [inline, virtual] |
vars_to_cols(const BCP_vec< BCP_cut * > &cuts, BCP_vec< BCP_var * > &vars, BCP_vec< BCP_col * > &cols, const BCP_lp_result &lpres, BCP_object_origin origin, bool allow_multiple) | BM_lp | [virtual] |
ws | BM_lp | [private] |
~BM_lp() | BM_lp | [virtual] |