Home
last modified time | relevance | path

Searched refs:new_cut (Results 1 – 25 of 52) sorted by relevance

123

/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/CutGen/
H A Dcnrp_cg.c261 FREE(new_cut);
269 FREE(new_cut);
345 FREE(new_cut);
449 FREE(new_cut);
463 FREE(new_cut);
473 FREE(new_cut);
780 FREE(new_cut);
954 FREE(new_cut);
1038 FREE(new_cut);
1137 FREE(new_cut);
[all …]
H A Dshrink.c45 new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? \
54 new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? \
86 new_cut->coef = coef = (char *) (calloc(new_cut->size, CSIZE)); in reduce_graph()
215 FREE(new_cut->coef); in reduce_graph()
243 new_cut->coef = coef = (char *) (calloc(new_cut->size, sizeof(char))); in greedy_shrinking1()
337 FREE(new_cut->coef); in greedy_shrinking1()
489 FREE(new_cut->coef); in greedy_shrinking1_dicut()
524 new_cut->coef =coef= (char *) (calloc(new_cut->size,sizeof(char))); in greedy_shrinking6()
862 new_cut->coef = coef = (char *) (calloc(new_cut->size,sizeof(char))); in greedy_shrinking1_one()
1029 new_cut->coef = coef = (char *) (calloc(new_cut->size,sizeof(char))); in greedy_shrinking6_one()
[all …]
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/src/CutGen/
H A Dcg_func.c115 new_cut->rhs != (*cuts)[i]->rhs){ in cg_send_cut()
118 if (!new_cut->coef){ in cg_send_cut()
122 new_cut->size) == 0){ in cg_send_cut()
127 new_cut->name = CUT__SEND_TO_CP; in cg_send_cut()
130 if (new_cut->size >0){ in cg_send_cut()
133 new_cut->size * sizeof(char)); in cg_send_cut()
145 pack_cut(new_cut); in cg_send_cut()
223 if (memcmp(new_cut->coef, (*cuts)[i]->coef, new_cut->size) == 0){ in cg_add_user_cut()
231 if (new_cut->size >0){ in cg_add_user_cut()
234 new_cut->size * sizeof(char)); in cg_add_user_cut()
[all …]
H A Dcg_wrapper.c122 int check_validity_of_cut_u(cg_prob *p, cut_data *new_cut) in check_validity_of_cut_u() argument
124 switch(new_cut->type){ in check_validity_of_cut_u()
135 CALL_USER_FUNCTION( user_check_validity_of_cut(p->user, new_cut) ); in check_validity_of_cut_u()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/CutGen/
H A Dshrink.c176 new_cut->coef = coef = (char *) (calloc(new_cut->size, sizeof(char))); in greedy_shrinking1()
226 new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? in greedy_shrinking1()
303 new_cut->coef =coef= (char *) (calloc(new_cut->size,sizeof(char))); in greedy_shrinking6()
372 new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? in greedy_shrinking6()
489 new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? in greedy_shrinking1_one()
528 new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? in greedy_shrinking1_one()
656 new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? in greedy_shrinking6_one()
694 new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? in greedy_shrinking6_one()
772 new_cut->coef =coef= (char *) (calloc(new_cut->size,sizeof(char))); in greedy_shrinking2_one()
820 new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? in greedy_shrinking2_one()
[all …]
H A Dvrp_cg.c370 new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ?
426 new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ?
566 FREE(new_cut);
718 new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ?
774 new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ?
792 FREE(new_cut);
863 new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ?
903 new_cut->rhs = (new_cut->type ==SUBTOUR_ELIM_SIDE ?
917 new_cut->rhs = (new_cut->type ==SUBTOUR_ELIM_SIDE ?
959 FREE(new_cut);
[all …]
/dports/math/libocas/libocas_v096/
H A Dfeatures_bool.c94 uint32_t *new_cut, in full_bool_add_new_cut() argument
116 if (ptr[LIBOCAS_INDEX(j,new_cut[i],dataDim)] & 0x01) { in full_bool_add_new_cut()
117 new_a[k] += data_y[new_cut[i]]; in full_bool_add_new_cut()
121 new_a[k] += data_y[new_cut[i]]; in full_bool_add_new_cut()
125 new_a[k] += data_y[new_cut[i]]; in full_bool_add_new_cut()
129 new_a[k] += data_y[new_cut[i]]; in full_bool_add_new_cut()
133 new_a[k] += data_y[new_cut[i]]; in full_bool_add_new_cut()
137 new_a[k] += data_y[new_cut[i]]; in full_bool_add_new_cut()
141 new_a[k] += data_y[new_cut[i]]; in full_bool_add_new_cut()
145 new_a[k] += data_y[new_cut[i]]; in full_bool_add_new_cut()
[all …]
H A Dfeatures_double.c32 uint32_t *new_cut, in msvm_sparse_add_new_cut() argument
45 if(new_cut[i] != y) in msvm_sparse_add_new_cut()
48 subtract_sparse_col(&new_a[nDim*(uint32_t)new_cut[i]], data_X, i); in msvm_sparse_add_new_cut()
129 int msvm_full_add_new_cut( double *new_col_H, uint32_t *new_cut, uint32_t nSel, void* user_data) in msvm_full_add_new_cut() argument
141 y2 = (uint32_t)new_cut[i]; in msvm_full_add_new_cut()
212 uint32_t *new_cut, in sparse_add_new_cut() argument
224 add_sparse_col(new_a, data_X, new_cut[i]); in sparse_add_new_cut()
226 A0[nSel] += X0*data_y[new_cut[i]]; in sparse_add_new_cut()
289 uint32_t *new_cut, in full_add_new_cut() argument
305 new_a[j] += ptr[LIBOCAS_INDEX(j,new_cut[i],nDim)]; in full_add_new_cut()
[all …]
H A Dfeatures_double.h14 uint32_t *new_cut,
21 uint32_t *new_cut,
29 extern int msvm_full_add_new_cut( double *new_col_H, uint32_t *new_cut, uint32_t nSel, void* user_d…
33 extern int msvm_sparse_add_new_cut( double *new_col_H, uint32_t *new_cut, uint32_t nSel, void* user…
H A Dlibocas.c88 uint32_t i, *new_cut; in svm_ocas_solver_nnw() local
113 new_cut=NULL; in svm_ocas_solver_nnw()
148 if(new_cut == NULL) in svm_ocas_solver_nnw()
248 new_cut[i] = i; in svm_ocas_solver_nnw()
571 new_cut=NULL; in svm_ocas_solver()
606 if(new_cut == NULL) in svm_ocas_solver()
685 new_cut[i] = i; in svm_ocas_solver()
996 new_cut=NULL; in svm_ocas_solver_difC()
1031 if(new_cut == NULL) in svm_ocas_solver_difC()
1112 new_cut[i] = i; in svm_ocas_solver_difC()
[all …]
H A Docas_lbp_helper.c113 uint32_t *new_cut, in full_add_new_cut() argument
132 idx = Wins[LIBOCAS_INDEX(0,new_cut[i],4)]-1; in full_add_new_cut()
133 x1 = Wins[LIBOCAS_INDEX(1,new_cut[i],4)]-1; in full_add_new_cut()
134 y1 = Wins[LIBOCAS_INDEX(2,new_cut[i],4)]-1; in full_add_new_cut()
135 mirror = Wins[LIBOCAS_INDEX(3,new_cut[i],4)]; in full_add_new_cut()
153 if(data_y[new_cut[i]] > 0) { in full_add_new_cut()
163 A0[nSel] += X0*data_y[new_cut[i]]; in full_add_new_cut()
H A Dfeatures_single.c23 uint32_t *new_cut, in full_single_add_new_cut() argument
39 new_a[j] += (double)ptr[LIBOCAS_INDEX(j,new_cut[i],nDim)]; in full_single_add_new_cut()
42 A0[nSel] += X0*data_y[new_cut[i]]; in full_single_add_new_cut()
H A Dfeatures_int8.c22 uint32_t *new_cut, in full_int8_add_new_cut() argument
39 new_a[j] += (double)ptr[LIBOCAS_INDEX(j,new_cut[i],nDim)]; in full_int8_add_new_cut()
42 A0[nSel] += X0*data_y[new_cut[i]]; in full_int8_add_new_cut()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/CutGen/Decomp/
H A Dmy_decomp_user.c1049 new_cut->rhs = (new_cut->type ==SUBTOUR_ELIM_SIDE ? in vrp_check_col()
1081 new_cut->rhs = (new_cut->type ==SUBTOUR_ELIM_SIDE ? in vrp_check_col()
1143 new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? in vrp_check_col()
1189 FREE(new_cut); in vrp_check_col()
1284 new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ?
1374 new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ?
1529 new_cut->rhs = (new_cut->type ==SUBTOUR_ELIM_SIDE ?
1561 new_cut->rhs = (new_cut->type ==SUBTOUR_ELIM_SIDE ?
1816 new_cut->coef = coef = malloc(new_cut->size);
2010 new_cut->coef = coef = calloc(new_cut->size, sizeof(char));
[all …]
H A Ddecomp_user.c282 cut_data *new_cut; in user_check_col() local
288 new_cut = (cut_data *) calloc (1, sizeof(cut_data)); in user_check_col()
289 new_cut->size = cut_size; in user_check_col()
300 new_cut->coef = (char *) calloc (cut_size, sizeof(char)); in user_check_col()
307 new_cut->coef[cur_vert >> DELETE_POWER] |= in user_check_col()
311 new_cut->type = (cust_num < vrp->vertnum/2 ? in user_check_col()
313 new_cut->rhs = (new_cut->type ==SUBTOUR_ELIM_SIDE ? in user_check_col()
316 if (check_cut(p, vrp, new_cut)) in user_check_col()
317 num_cuts += cg_send_cut(new_cut); in user_check_col()
334 free ((char *) new_cut->coef); in user_check_col()
[all …]
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/MPP/src/CutGen/
H A Dmpp_cg.c75 cut_data *new_cut = NULL; in user_find_cuts() local
95 new_cut = (cut_data *) calloc(1, sizeof(cut_data)); in user_find_cuts()
195 new_cut->coef = (char*)return_list; in user_find_cuts()
196 new_cut->size = cut_sizes[i]*4; in user_find_cuts()
197 new_cut->type = ODD_CUT; in user_find_cuts()
198 new_cut->sense ='G'; in user_find_cuts()
199 num_cuts += cg_send_cut(new_cut); in user_find_cuts()
205 FREE(new_cut); in user_find_cuts()
212 FREE(new_cut); in user_find_cuts()
240 int user_check_validity_of_cut(void *user, cut_data *new_cut) in user_check_validity_of_cut() argument
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/SPP+CUTS/src/CutGen/
H A Dspp_cg_clique.c118 new_cut = spp->tmp->cuttmp; in find_violated_star_cliques()
386 new_cut = spp->tmp->cuttmp; in find_violated_row_cliques()
565 new_cut->type = CLIQUE; in enumerate_maximal_cliques()
566 new_cut->size = cnt * ISIZE; in enumerate_maximal_cliques()
567 new_cut->rhs = 1; in enumerate_maximal_cliques()
568 new_cut->range = 0; in enumerate_maximal_cliques()
569 new_cut->sense = 'L'; in enumerate_maximal_cliques()
625 new_cut->type = CLIQUE; in greedy_maximal_clique()
627 new_cut->rhs = 1; in greedy_maximal_clique()
628 new_cut->range = 0; in greedy_maximal_clique()
[all …]
H A Dspp_cg_functions.c129 new_cut->rhs = l; in find_violated_odd_holes()
130 new_cut->range = 0; in find_violated_odd_holes()
131 new_cut->sense = 'L'; in find_violated_odd_holes()
159 new_cut->rhs = l; in find_violated_odd_holes()
160 new_cut->range = 0; in find_violated_odd_holes()
161 new_cut->sense = 'L'; in find_violated_odd_holes()
743 new_cut->rhs = 2; in find_violated_odd_antiholes()
744 new_cut->range = 0; in find_violated_odd_antiholes()
745 new_cut->sense = 'L'; in find_violated_odd_antiholes()
774 new_cut->rhs = 2; in find_violated_odd_antiholes()
[all …]
H A Dspp_cg.c576 switch (new_cut->type) { in register_and_send_cut()
621 switch (new_cut->type) { in register_and_send_cut()
630 if (cuts[i]->type == new_cut->type && in register_and_send_cut()
632 !memcmp(cuts[i]->coef, new_cut->coef, new_cut->size)) in register_and_send_cut()
642 !memcmp(cuts[i]->coef, new_cut->coef, new_cut->size)) in register_and_send_cut()
652 !memcmp(cuts[i]->coef, new_cut->coef, new_cut->size)) in register_and_send_cut()
658 cuts[i]->rhs+cuts[i]->range<=new_cut->rhs+new_cut->range+etol) in register_and_send_cut()
687 *cuts[pos] = *new_cut; in register_and_send_cut()
689 memcpy(cuts[pos]->coef, new_cut->coef, new_cut->size); in register_and_send_cut()
831 new_cut->size = coef_num * ISIZE; in extend_clique_on_fgraph()
[all …]
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/SPP+CUTS/src/LP/
H A Dspp_lp_functions.c346 cut_data *new_cut; in lift_cut_in_lp() local
366 new_cut->coef = coef; in lift_cut_in_lp()
372 memcpy(new_coef, new_cut->coef, new_cut->size * CSIZE); in lift_cut_in_lp()
373 new_cut->coef = new_coef; in lift_cut_in_lp()
376 **plifted_cuts = new_cut; in lift_cut_in_lp()
551 new_cut->type = CLIQUE_LIFTED; in lift_clique()
552 new_cut->size = length * ISIZE; in lift_clique()
554 new_cut->rhs = 1; in lift_clique()
555 new_cut->range = 0; in lift_clique()
556 new_cut->sense = 'L'; in lift_clique()
[all …]
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/include/
H A Dcnrp_cg.h87 double capacity, int mult, cut_data *new_cut,
90 int max_num_cuts, cut_data *new_cut,
97 int max_num_cuts, cut_data *new_cut,
104 double etol, cut_data *new_cut,
112 double etol, cut_data *new_cut,
121 cut_data *new_cut, char *in_set,
127 double etol, cut_data *new_cut,
134 double etol, cut_data *new_cut,
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/include/
H A Dvrp_cg.h84 int max_num_cuts, cut_data *new_cut,
90 double etol, cut_data *new_cut,
99 cut_data *new_cut, char *in_set,
104 double etol, cut_data *new_cut,
111 double etol, cut_data *new_cut,
/dports/math/osi-conic/OSI-CONIC-releases-1.0.0/src/
H A DOsiConicCut.cpp491 OsiConicCut * new_cut = new OsiConicCut(); in clone() local
492 new_cut->setConeMembers(coneMembers(), coneSize()); in clone()
493 new_cut->setConeType(coneType()); in clone()
494 new_cut->setCutRow(cutRowPtr(), numCutRows(), coneSize()); in clone()
495 new_cut->setCutRowLb(cutRowLb(), numCutRows()); in clone()
496 new_cut->setCutRowUb(cutRowUb(), numCutRows()); in clone()
497 new_cut->setCutCol(cutCol()); in clone()
498 new_cut->setCutColLb(cutColLb(), numCutCols()); in clone()
499 new_cut->setCutColUb(cutColUb(), numCutCols()); in clone()
500 new_cut->setEffectiveness(effectiveness()); in clone()
[all …]
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/include/
H A Dsym_cg_u.h24 int cg_add_user_cut PROTO((cut_data *new_cut, int *num_cuts, int *alloc_cuts,
26 int cg_send_cut PROTO((cut_data *new_cut, int *num_cuts, int *alloc_cuts,
41 int user_check_validity_of_cut PROTO((void *user, cut_data *new_cut));
H A Dsym_cg.h61 int cg_add_user_cut PROTO((cut_data *new_cut, int *num_cuts, int *alloc_cuts,
69 int cg_send_cut PROTO((cut_data *new_cut, int *num_cuts, int *alloc_cuts,
80 int check_validity_of_cut_u PROTO((cg_prob *p, cut_data *new_cut));

123