00001 /*===========================================================================*/ 00002 /* */ 00003 /* This file is part of a demonstration application for use with the */ 00004 /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ 00005 /* Capacitated Network Routing Problems. */ 00006 /* */ 00007 /* (c) Copyright 2000-2008 Ted Ralphs. All Rights Reserved. */ 00008 /* */ 00009 /* This application was developed by Ted Ralphs (tkralphs@lehigh.edu) */ 00010 /* */ 00011 /* This software is licensed under the Common Public License. Please see */ 00012 /* accompanying file for terms. */ 00013 /* */ 00014 /*===========================================================================*/ 00015 00016 #ifndef _CUT_GEN_USER_PARAMS_H 00017 #define _CUT_GEN_USER_PARAMS_H 00018 00019 /* which_connected_routine choices */ 00020 #define CONNECTED 0 00021 #define BICONNECTED 1 00022 #define BOTH 2 00023 00024 typedef struct CG_USER_PARAMS{ 00025 int verbosity; 00026 char prob_type; 00027 int do_greedy; 00028 int greedy_num_trials; 00029 int do_extra_in_root; 00030 int which_tsp_cuts; 00031 int which_connected_routine; 00032 int max_num_cuts_in_shrink; 00033 int generate_x_cuts; 00034 int generate_cap_cuts; 00035 int generate_tight_cap_cuts; 00036 /*for minimumn cut*/ 00037 int do_mincut; 00038 int do_extra_checking; 00039 int update_contr_above; 00040 int shrink_one_edges; 00041 double tau; 00042 }cnrp_cg_params; 00043 00044 #endif
1.4.7