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 /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ 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 _VRP_CG_PARAMS_H 00017 #define _VRP_CG_PARAMS_H 00018 00019 /* which_connected_routine choices */ 00020 #define CONNECTED 0 00021 #define BICONNECTED 1 00022 #define BOTH 2 00023 00024 typedef struct VRP_CG_PARAMS{ 00025 int verbosity; 00026 char tsp_prob; 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 }vrp_cg_params; 00034 00035 #endif
1.4.7