This is the complete list of members for MC_lp, including all inherited members.
| append_branching_vars(const double *x, const BCP_vec< BCP_var * > &vars, const BCP_vec< int > &select_pos, BCP_vec< BCP_lp_branching_object * > &candidates) | BCP_lp_user | |
| BCP_lp_user() | BCP_lp_user | inline |
| best_presolved | MC_lp | |
| branch_close_to_half(const BCP_lp_result &lpres, const BCP_vec< BCP_var * > &vars, const int to_be_selected, const double etol, BCP_vec< BCP_lp_branching_object * > &candidates) | BCP_lp_user | |
| branch_close_to_one(const BCP_lp_result &lpres, const BCP_vec< BCP_var * > &vars, const int to_be_selected, const double etol, BCP_vec< BCP_lp_branching_object * > &candidates) | BCP_lp_user | |
| broadcast_message(const BCP_process_t proc_type, const BCP_buffer &buf) | BCP_lp_user | |
| choose_branching_vars(const BCP_vec< BCP_var * > &vars, const double *x, const int cand_num, BCP_vec< BCP_lp_branching_object * > &cands) | MC_lp | |
| compare_branching_candidates(BCP_presolved_lp_brobj *new_presolved, BCP_presolved_lp_brobj *old_presolved) | MC_lp | virtual |
| compare_cuts(const BCP_cut *c0, const BCP_cut *c1) | MC_lp | virtual |
| compare_vars(const BCP_var *v0, const BCP_var *v1) | BCP_lp_user | virtual |
| 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) | BCP_lp_user | virtual |
| current_index() const | BCP_lp_user | |
| current_iteration() const | BCP_lp_user | |
| current_level() const | BCP_lp_user | |
| current_phase() const | BCP_lp_user | |
| 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) | MC_lp | virtual |
| display_lp_solution(const BCP_lp_result &lp_result, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts, const bool final_lp_solution) | BCP_lp_user | virtual |
| 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) | MC_lp | virtual |
| generate_cuts_in_lp(const double *x, const double *lhs, const double objval, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts, BCP_vec< BCP_cut * > &new_cuts, BCP_vec< BCP_row * > &new_rows) | MC_lp | |
| generate_heuristic_solution(const BCP_lp_result &lpres, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts) | MC_lp | virtual |
| generate_mst_cuts(const double *x, const double *lhs, const double objval, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts, BCP_vec< BCP_cut * > &new_cuts, BCP_vec< BCP_row * > &new_rows) | MC_lp | |
| generate_sp_cuts(const double *x, const double *lhs, const double objval, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts, BCP_vec< BCP_cut * > &new_cuts, BCP_vec< BCP_row * > &new_rows) | MC_lp | |
| generate_vars_in_lp(const BCP_lp_result &lpres, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts, const bool before_fathom, BCP_vec< BCP_var * > &new_vars, BCP_vec< BCP_col * > &new_cols) | BCP_lp_user | virtual |
| get_param(const BCP_lp_par::chr_params key) const | BCP_lp_user | |
| get_param(const BCP_lp_par::int_params key) const | BCP_lp_user | |
| get_param(const BCP_lp_par::dbl_params key) const | BCP_lp_user | |
| get_param(const BCP_lp_par::str_params key) const | BCP_lp_user | |
| get_user_data() | BCP_lp_user | |
| getLpProblemPointer() | BCP_lp_user | inline |
| getMaxLpViol() | MC_lp | |
| getOsiBabSolver() | BCP_lp_user | inline |
| hist_len | MC_lp | |
| initialize_int_and_sos_list(std::vector< OsiObject * > &intAndSosObjects) | BCP_lp_user | virtual |
| initialize_new_search_tree_node(const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts, const BCP_vec< BCP_obj_status > &var_status, const BCP_vec< BCP_obj_status > &cut_status, BCP_vec< int > &var_changed_pos, BCP_vec< double > &var_new_bd, BCP_vec< int > &cut_changed_pos, BCP_vec< double > &cut_new_bd) | BCP_lp_user | virtual |
| initialize_solver_interface() | MC_lp | virtual |
| is_gap_tailoff_rel(const int k, const double minimp, const double objval) const | MC_lp | |
| is_lb_tailoff_abs(const int k, const double minimp, const double objval) const | MC_lp | |
| is_lb_tailoff_rel(const int k, const double minimp, const double objval) const | MC_lp | |
| load_problem(OsiSolverInterface &osi, BCP_problem_core *core, BCP_var_set &vars, BCP_cut_set &cuts) | BCP_lp_user | virtual |
| logical_fixing(const BCP_lp_result &lpres, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts, const BCP_vec< BCP_obj_status > &var_status, const BCP_vec< BCP_obj_status > &cut_status, const int var_bound_changes_since_logical_fixing, BCP_vec< int > &changed_pos, BCP_vec< double > &new_bd) | MC_lp | virtual |
| mc | MC_lp | |
| mc_generate_heuristic_solution(const double *x, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts) | MC_lp | |
| MC_lp(const MC_lp &) | MC_lp | private |
| MC_lp() | MC_lp | inline |
| modify_lp_parameters(OsiSolverInterface *lp, const int changeType, bool in_strong_branching) | MC_lp | virtual |
| obj_shift | MC_lp | |
| objhist | MC_lp | |
| operator=(const MC_lp &) | MC_lp | private |
| over_ub(double lb) const | BCP_lp_user | |
| pack_dual_solution(BCP_buffer &buf, const BCP_lp_result &lp_result, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts) | BCP_lp_user | virtual |
| pack_feasible_solution(BCP_buffer &buf, const BCP_solution *sol) | MC_lp | virtual |
| pack_primal_solution(BCP_buffer &buf, const BCP_lp_result &lp_result, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts) | BCP_lp_user | virtual |
| par | MC_lp | |
| parent() const | BCP_lp_user | |
| perform_strong_branching(const BCP_lp_result &lpres, OsiSolverInterface *exact_solver, BCP_vec< BCP_lp_branching_object * > &cands) | MC_lp | |
| print(const bool ifprint, const char *format,...) const | BCP_lp_user | |
| process_id() const | BCP_lp_user | |
| process_lp_result(const BCP_lp_result &lpres, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts, const double old_lower_bound, double &true_lower_bound, BCP_solution *&sol, BCP_vec< BCP_cut * > &new_cuts, BCP_vec< BCP_row * > &new_rows, BCP_vec< BCP_var * > &new_vars, BCP_vec< BCP_col * > &new_cols) | BCP_lp_user | virtual |
| process_message(BCP_buffer &buf) | BCP_lp_user | virtual |
| purge_slack_pool(const BCP_vec< BCP_cut * > &slack_pool, BCP_vec< int > &to_be_purged) | BCP_lp_user | virtual |
| receive_message(const int sender, BCP_buffer &buf, BCP_message_tag tag=BCP_Msg_User) | BCP_lp_user | |
| reduced_cost_fixing(const double *dj, const double *x, const double gap, BCP_vec< BCP_var * > &vars, int &newly_changed) | BCP_lp_user | |
| restore_feasibility(const BCP_lp_result &lpres, const std::vector< double * > dual_rays, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts, BCP_vec< BCP_var * > &vars_to_add, BCP_vec< BCP_col * > &cols_to_add) | BCP_lp_user | 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 * > &candidates, bool force_branch=false) | MC_lp | virtual |
| select_cuts_to_delete(const BCP_lp_result &lpres, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts, const bool before_fathom, BCP_vec< int > &deletable) | BCP_lp_user | virtual |
| select_fractions(const double *first, const double *last, const double etol, BCP_vec< int > &fractions) const | BCP_lp_user | |
| select_nonzeros(const double *first, const double *last, const double etol, BCP_vec< int > &nonzeros) const | BCP_lp_user | |
| select_positives(const double *first, const double *last, const double etol, BCP_vec< int > &positives) const | BCP_lp_user | |
| select_vars_to_delete(const BCP_lp_result &lpres, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts, const bool before_fathom, BCP_vec< int > &deletable) | BCP_lp_user | virtual |
| select_zeros(const double *first, const double *last, const double etol, BCP_vec< int > &zeros) const | BCP_lp_user | |
| send_feasible_solution(const BCP_solution *sol) | BCP_lp_user | |
| send_message(const int target, const BCP_buffer &buf, BCP_message_tag tag=BCP_Msg_User) | BCP_lp_user | |
| set_actions_for_children(BCP_presolved_lp_brobj *best) | MC_lp | virtual |
| set_param(const BCP_lp_par::chr_params key, const bool val) | BCP_lp_user | |
| set_param(const BCP_lp_par::chr_params key, const char val) | BCP_lp_user | |
| set_param(const BCP_lp_par::int_params key, const int val) | BCP_lp_user | |
| set_param(const BCP_lp_par::dbl_params key, const double val) | BCP_lp_user | |
| set_param(const BCP_lp_par::str_params key, const char *val) | BCP_lp_user | |
| set_user_data_for_children(BCP_presolved_lp_brobj *best, const int selected) | BCP_lp_user | virtual |
| set_user_data_for_children(BCP_presolved_lp_brobj *best) | BCP_lp_user | virtual |
| setLpProblemPointer(BCP_lp_prob *ptr) | BCP_lp_user | inline |
| setOsiBabSolver(OsiBabSolver *ptr) | BCP_lp_user | inline |
| soln | MC_lp | |
| solveToOpt(OsiVolSolverInterface *vollp, const BCP_lp_result &lpres, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts, double &exact_obj) | MC_lp | |
| start_time() const | BCP_lp_user | |
| started_exact | MC_lp | |
| tailoff_test(bool &tailoff_gap_rel, bool &tailoff_lb_abs, bool &tailoff_lb_rel, const double objval) const | MC_lp | |
| test_binary(const BCP_lp_result &lpres, const BCP_vec< BCP_var * > &vars, const double etol) const | BCP_lp_user | |
| test_feasibility(const BCP_lp_result &lp_result, const BCP_vec< BCP_var * > &vars, const BCP_vec< BCP_cut * > &cuts) | MC_lp | virtual |
| test_full(const BCP_lp_result &lpres, const BCP_vec< BCP_var * > &vars, const double etol) const | BCP_lp_user | |
| test_integral(const BCP_lp_result &lpres, const BCP_vec< BCP_var * > &vars, const double etol) const | BCP_lp_user | |
| tried_hard_cuts_in_prev_major_iter | MC_lp | |
| try_to_branch(OsiBranchingInformation &branchInfo, OsiSolverInterface *solver, OsiChooseVariable *choose, OsiBranchingObject *&branchObject, bool allowVarFix) | BCP_lp_user | virtual |
| unique_cycle_cuts(BCP_vec< BCP_cut * > &new_cuts, BCP_vec< BCP_row * > &new_rows) | MC_lp | |
| unpack_module_data(BCP_buffer &buf) | MC_lp | virtual |
| upper_bound() const | BCP_lp_user | |
| 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) | BCP_lp_user | virtual |
| ~BCP_lp_user() | BCP_lp_user | inlinevirtual |
| ~BCP_user_class() | BCP_user_class | inlinevirtual |
| ~MC_lp() | MC_lp | inline |
1.8.5