| 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 ([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 _CUT_GEN_USER_PARAMS_H |
| 17 |
#define _CUT_GEN_USER_PARAMS_H |
| 18 |
|
| 19 |
/* which_connected_routine choices */ |
| 20 |
#define CONNECTED 0 |
| 21 |
#define BICONNECTED 1 |
| 22 |
#define BOTH 2 |
| 23 |
|
| 24 |
typedef struct CG_USER_PARAMS{ |
| 25 |
int verbosity; |
| 26 |
char prob_type; |
| 27 |
int do_greedy; |
| 28 |
int greedy_num_trials; |
| 29 |
int do_extra_in_root; |
| 30 |
int which_tsp_cuts; |
| 31 |
int which_connected_routine; |
| 32 |
int max_num_cuts_in_shrink; |
| 33 |
int generate_x_cuts; |
| 34 |
int generate_cap_cuts; |
| 35 |
int generate_tight_cap_cuts; |
| 36 |
/*for minimumn cut*/ |
| 37 |
int do_mincut; |
| 38 |
int do_extra_checking; |
| 39 |
int update_contr_above; |
| 40 |
int shrink_one_edges; |
| 41 |
double tau; |
| 42 |
}cnrp_cg_params; |
| 43 |
|
| 44 |
#endif |