Dip
0.92.4
|
Go to the source code of this file.
Classes | |
struct | FP_VARS |
struct | FP_DATA |
Typedefs | |
typedef struct FP_VARS | FPvars |
typedef struct FP_DATA | FPdata |
Functions | |
int sp_add_solution | PROTO ((lp_prob *p, int cnt, int *indices, double *values, double obj_value, int bc_index)) |
int sp_delete_solution | PROTO ((sp_desc *sp, int position)) |
int sp_is_solution_in_sp | PROTO ((lp_prob *p, int cnt, int *indices, double *values, double obj_value)) |
int | sp_free_sp (sp_desc *sp) |
int | feasibility_pump (lp_prob *p, char *found_better_solution, double &solution_value, double *colSolution, double *betterSolution) |
int | fp_round (lp_prob *p, FPdata *fp_data, LPdata *lp_data) |
int | fp_is_feasible (LPdata *lp_data, const CoinPackedMatrix *matrix, const double *r_low, const double *r_up, FPdata *fp_data, char *is_feasible) |
int | fp_initialize_lp_solver (lp_prob *p, LPdata *new_lp_data, FPdata *fp_data, double *colSolution) |
int | fp_solve_lp (LPdata *lp_data, FPdata *fp_data, char *is_feasible) |
int | fp_should_call_fp (lp_prob *p, int branching, int *should_call, char is_last_iter, double t_lb) |
int | fp_add_obj_row (LPdata *new_lp_data, int n, const double *obj, double rhs) |
int | fp_can_sos_var_fix (lp_prob *p, FPdata *fp_data, int ind, int *filled_row_count) |
int | fp_fix_sos_var (lp_prob *p, FPdata *fp_data, int ind) |
int round_solution | PROTO ((lp_prob *p, LPdata *lp_data, double *solution_value, double *betterSolution, double t_lb)) |
int apply_local_search | PROTO ((lp_prob *p, double *solution_value, double *col_solution, double *better_solution, double *dual_gap, double t_lb)) |
int local_search | PROTO ((lp_prob *p, double *solution_value, double *col_solution, double *better_solution, double t_lb)) |
int diving_search | PROTO ((lp_prob *p, double *solutionValue, double *colSolution, double *betterSolution, char is_last_iter, double t_lb)) |
int ds_fix_vars | PROTO ((lp_prob *p, LPdata *diving_lp, double *x, int *frac_ind, int frac_cnt, int d_fixed_cnt, int fix_incr_cnt, int d_type, double *obj, double *ip_sol, double *x_rank, char *direction, int *min_ind, char *min_dir, char should_fix)) |
int ds_get_frac_vars | PROTO ((LPdata *lp_data, double *x, int *indices, int *frac_ip_cnt, int *int_ip_cnt)) |
int ds_fix_common_vars | PROTO ((LPdata *lp_data, var_desc **vars, double *ip_sol, double *x)) |
int restricted_search | PROTO ((lp_prob *p, double *solution_value, double *colSolution, double *betterSolution, int fr_mode, double t_lb)) |
int | fr_force_feasible (lp_prob *p, char use_base, int *sym_fixed_int_cnt, int *sym_fixed_c_cnt, char *sym_fixed_type, double *sym_fixed_val, int *max_int_fix, int *max_c_fix) |
int lbranching_search | PROTO ((lp_prob *p, double *solution_value, double *colSolution, double *betterSolution, double t_lb)) |
int | resize_tmp1_arrays (LPdata *lp_data, int new_size) |
sym_environment *lp_to_sym | PROTO ((lp_prob *p, LPdata *lp_data, char use_base, int sym_fixed_cnt, char *sym_fixed_type, double *sym_fixed_val, double *sym_fixed_offset, int *unfix_nz, int *new_ind)) |
int sp_add_solution PROTO | ( | (lp_prob *p, int cnt, int *indices, double *values, double obj_value, int bc_index) | ) |
int sp_delete_solution PROTO | ( | (sp_desc *sp, int position) | ) |
int sp_is_solution_in_sp PROTO | ( | (lp_prob *p, int cnt, int *indices, double *values, double obj_value) | ) |
int sp_free_sp | ( | sp_desc * | sp | ) |
int feasibility_pump | ( | lp_prob * | p, |
char * | found_better_solution, | ||
double & | solution_value, | ||
double * | colSolution, | ||
double * | betterSolution | ||
) |
int fp_is_feasible | ( | LPdata * | lp_data, |
const CoinPackedMatrix * | matrix, | ||
const double * | r_low, | ||
const double * | r_up, | ||
FPdata * | fp_data, | ||
char * | is_feasible | ||
) |
int fp_initialize_lp_solver | ( | lp_prob * | p, |
LPdata * | new_lp_data, | ||
FPdata * | fp_data, | ||
double * | colSolution | ||
) |
int fp_should_call_fp | ( | lp_prob * | p, |
int | branching, | ||
int * | should_call, | ||
char | is_last_iter, | ||
double | t_lb | ||
) |
int fp_add_obj_row | ( | LPdata * | new_lp_data, |
int | n, | ||
const double * | obj, | ||
double | rhs | ||
) |
int shift_solution PROTO | ( | (lp_prob *p, LPdata *lp_data, double *solution_value, double *betterSolution, double t_lb) | ) |
int apply_local_search PROTO | ( | (lp_prob *p, double *solution_value, double *col_solution, double *better_solution, double *dual_gap, double t_lb) | ) |
int local_search PROTO | ( | (lp_prob *p, double *solution_value, double *col_solution, double *better_solution, double t_lb) | ) |
int diving_search PROTO | ( | (lp_prob *p, double *solutionValue, double *colSolution, double *betterSolution, char is_last_iter, double t_lb) | ) |
int ds_fix_vars PROTO | ( | (lp_prob *p, LPdata *diving_lp, double *x, int *frac_ind, int frac_cnt, int d_fixed_cnt, int fix_incr_cnt, int d_type, double *obj, double *ip_sol, double *x_rank, char *direction, int *min_ind, char *min_dir, char should_fix) | ) |
int ds_get_frac_vars PROTO | ( | (LPdata *lp_data, double *x, int *indices, int *frac_ip_cnt, int *int_ip_cnt) | ) |
int restricted_search PROTO | ( | (lp_prob *p, double *solution_value, double *colSolution, double *betterSolution, int fr_mode, double t_lb) | ) |
int fr_force_feasible | ( | lp_prob * | p, |
char | use_base, | ||
int * | sym_fixed_int_cnt, | ||
int * | sym_fixed_c_cnt, | ||
char * | sym_fixed_type, | ||
double * | sym_fixed_val, | ||
int * | max_int_fix, | ||
int * | max_c_fix | ||
) |
int lbranching_search PROTO | ( | (lp_prob *p, double *solution_value, double *colSolution, double *betterSolution, double t_lb) | ) |
int resize_tmp1_arrays | ( | LPdata * | lp_data, |
int | new_size | ||
) |
sym_environment* lp_to_sym PROTO | ( | (lp_prob *p, LPdata *lp_data, char use_base, int sym_fixed_cnt, char *sym_fixed_type, double *sym_fixed_val, double *sym_fixed_offset, int *unfix_nz, int *new_ind) | ) |