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_LP_PARAMS_H 00017 #define _VRP_LP_PARAMS_H 00018 00019 /*---------------------------------------------------------------------------*\ 00020 * Here we store the vrp specific data needed to process each node of the tree 00021 \*---------------------------------------------------------------------------*/ 00022 00023 typedef struct VRP_LP_PARAMS{ 00024 int verbosity; 00025 int branching_rule; 00026 int detect_tailoff; /* 1 indicates tailing-off detection is desirable */ 00027 float child_compar_obj_tol; 00028 int branch_on_cuts; 00029 int strong_branching_cand_num_max; 00030 int strong_branching_cand_num_min; 00031 int strong_branching_red_ratio; 00032 }vrp_lp_params; 00033 00034 #endif
1.4.7