| 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 |
/* the Vehicle Routing Problem and the Traveling Salesman Problem. */ |
| 6 |
/* */ |
| 7 |
/* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ |
| 8 |
/* */ |
| 9 |
/* This application was developed by Ted Ralphs ([email protected]) */ |
| 10 |
/* */ |
| 11 |
/* This software is licensed under the Eclipse Public License. Please see */ |
| 12 |
/* accompanying file for terms. */ |
| 13 |
/* */ |
| 14 |
/*===========================================================================*/ |
| 15 |
|
| 16 |
#ifndef _VRP_LP_PARAMS_H |
| 17 |
#define _VRP_LP_PARAMS_H |
| 18 |
|
| 19 |
/*---------------------------------------------------------------------------*\ |
| 20 |
* Here we store the vrp specific data needed to process each node of the tree |
| 21 |
\*---------------------------------------------------------------------------*/ |
| 22 |
|
| 23 |
typedef struct VRP_LP_PARAMS{ |
| 24 |
int verbosity; |
| 25 |
int branching_rule; |
| 26 |
int detect_tailoff; /* 1 indicates tailing-off detection is desirable */ |
| 27 |
float child_compar_obj_tol; |
| 28 |
int branch_on_cuts; |
| 29 |
int strong_branching_cand_num_max; |
| 30 |
int strong_branching_cand_num_min; |
| 31 |
int strong_branching_red_ratio; |
| 32 |
}vrp_lp_params; |
| 33 |
|
| 34 |
#endif |