1 /*===========================================================================*/ 2 /* */ 3 /* This file is part of a demonstration application for use with the */ 4 /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ 5 /* Capacitated Network Routing Problems. */ 6 /* */ 7 /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ 8 /* */ 9 /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ 10 /* */ 11 /* This software is licensed under the Eclipse Public License. Please see */ 12 /* accompanying file for terms. */ 13 /* */ 14 /*===========================================================================*/ 15 16 #ifndef _CNRP_LP_PARAMS_H 17 #define _CNRP_LP_PARAMS_H 18 19 /*---------------------------------------------------------------------------*\ 20 * Here we store the specific data needed to process each node of the tree 21 \*---------------------------------------------------------------------------*/ 22 23 typedef struct CNRP_LP_PARAMS{ 24 int verbosity; 25 char prob_type; 26 int branching_rule; 27 int detect_tailoff; /* 1 indicates tailing-off detection is desirable */ 28 float child_compar_obj_tol; 29 int branch_on_cuts; 30 int strong_branching_cand_num_max; 31 int strong_branching_cand_num_min; 32 int strong_branching_red_ratio; 33 double gamma; /*Determines the fixed cost*/ 34 double tau; /*Determines the variable cost*/ 35 double rho; 36 }cnrp_lp_params; 37 38 #endif 39