, including all inherited members.
| add_sol_candidate(const dvector &x) | RelaxationSolver | [protected, virtual] |
| clean_sub_problems() | RelaxationSolver | [inline, protected] |
| convex_prob | RelaxationSolver | [protected] |
| couple_con_violation(const dvector &x) | LagHeu | [protected] |
| delta | LagHeu | [protected] |
| dim() const | Solver | [inline] |
| dim_ | Solver | [protected] |
| DISTANCE enum value | LagHeu_SimAnnealing | [private] |
| get_Wz(dvector &Wz, const ivector &z) | LagHeu_SimAnnealing | [private] |
| is_gams_prob | RelaxationSolver | [protected] |
| iter() | Solver | [inline] |
| iter_ | Solver | [protected] |
| iter_max | Solver | |
| LagHeu(Pointer< MinlpProblem > orig_prob_, Pointer< LinearRelax > linrelax_, bool is_gams_prob=false, double closeval_tol_=0., Pointer< dvector > diam_=NULL, Pointer< Param > param_=NULL, Pointer< ostream > out_solver_p_=out_out_p, Pointer< ostream > out_solver_log_p_=out_log_p) | LagHeu | [inline] |
| lagheu_LP_columns | LagHeu | [protected] |
| lagheu_LP_fixblock(int k, const MIPSolver::ColItem *colitem) | LagHeu | [protected] |
| lagheu_LP_unfixblock(int k) | LagHeu | [protected] |
| LagHeu_SimAnnealing(Pointer< MinlpProblem > orig_prob_, Pointer< LinearRelax > linrelax_, bool is_gams_prob=false, double closeval_tol_=0., Pointer< dvector > diam_=NULL, Pointer< Param > param_=NULL, Pointer< ostream > out_solver_p_=out_out_p, Pointer< ostream > out_solver_log_p_=out_log_p) | LagHeu_SimAnnealing | |
| last_impr_iter | RelaxationSolver | [protected] |
| levelcuts | RelaxationSolver | [protected] |
| linear_relax | RelaxationSolver | [protected] |
| locopt_NLP(dvector &start) | RelaxationSolver | [protected] |
| locopt_NLP(dvector &start, dvector &sol_point) | RelaxationSolver | [protected] |
| lower_bound | RelaxationSolver | |
| make_lagheu_LP(double delta) | LagHeu | [protected] |
| make_project_LP() | LagHeu | [protected] |
| make_sub_prob(Pointer< MinlpProblem > &out, Pointer< MinlpProblem > in, Pointer< MinlpNode > node) | RelaxationSolver | [protected] |
| minlpdata | RelaxationSolver | [protected] |
| minor_iter_max | LagHeu_SimAnnealing | [private] |
| node | LagHeu | [protected] |
| nonsingles | LagHeu_SimAnnealing | [private] |
| opt_val() | Solver | [inline] |
| opt_val_ | Solver | [protected] |
| orig_prob | RelaxationSolver | [protected] |
| out_solver_log_p | Solver | |
| out_solver_p | Solver | |
| param | RelaxationSolver | [protected] |
| point_conversion_warnings | RelaxationSolver | [protected] |
| print(ostream &out) const | Solver | [inline, virtual] |
| project_and_round(dvector &x) | LagHeu | [protected] |
| project_LP_fix_variable(int i, double val) | LagHeu | [protected] |
| project_LP_unfix_variable(int i) | LagHeu | [protected] |
| reform | RelaxationSolver | [protected] |
| RelaxationSolver(Pointer< MinlpProblem > orig_prob_, bool is_gams_prob=false, double closeval_tol_=0., Pointer< dvector > diam_=NULL, Pointer< Param > param_=NULL, Pointer< ostream > out_solver_p_=out_out_p, Pointer< ostream > out_solver_log_p_=out_log_p) | RelaxationSolver | |
| set_convex_prob(Pointer< MinlpProblem > convex_prob_) | RelaxationSolver | [inline] |
| set_levelcut_handler(Pointer< LevelCutHandler > levelcuts_) | RelaxationSolver | [inline] |
| set_linear_relax(Pointer< LinearRelax > linrelax_) | LagHeu | [inline] |
| set_MINLPData(Pointer< MINLPData > minlpdata_) | RelaxationSolver | [inline] |
| set_reform(Pointer< Reformulation > reform_) | RelaxationSolver | [inline, virtual] |
| set_split_prob(Pointer< MinlpProblem > split_prob_) | RelaxationSolver | [inline] |
| set_upper_bound(double upper_bound) | RelaxationSolver | [inline] |
| sol_cand | RelaxationSolver | |
| sol_cand_closeval_tol | RelaxationSolver | [protected] |
| sol_cand_diam | RelaxationSolver | [protected] |
| sol_point | Solver | |
| solve(Pointer< MinlpNode > node_) | LagHeu_SimAnnealing | [virtual] |
| LagHeu::solve() | LagHeu | [inline, virtual] |
| RelaxationSolver::solve(dvector &x) | Solver | [inline, virtual] |
| solve_lagheu_LP() | LagHeu | [protected] |
| solve_lagheu_LP(dvector &z, dvector &x) | LagHeu | [protected] |
| solve_lagheu_LP(vector< dvector > &z, dvector &x) | LagHeu | [protected] |
| solve_project_LP(dvector &sol) | LagHeu | [protected] |
| solve_project_LP(double &val) | LagHeu | [protected] |
| Solver(int n, Pointer< ostream > out_solver_p_=out_out_p, Pointer< ostream > out_solver_log_p_=out_log_p) | Solver | [inline] |
| split_prob | RelaxationSolver | [protected] |
| time() | Solver | [inline] |
| time_ | Solver | [protected] |
| tol | Solver | |
| update_project_LP() | LagHeu | [protected] |
| update_project_LP_x(const dvector &x) | LagHeu | [protected] |
| VIOLATION enum value | LagHeu_SimAnnealing | [private] |
| walk(ivector &z, dvector &Wz, double &weight_z, double T, int max_iter) | LagHeu_SimAnnealing | [private] |
| weight(const ivector &z, const dvector &Wz) | LagHeu_SimAnnealing | [private] |
| weight_type | LagHeu_SimAnnealing | [private] |
| Z | LagHeu_SimAnnealing | [private] |
| ~Solver() | Solver | [inline, virtual] |
