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 Set Partitioning Problem. */ 00006 /* */ 00007 /* (c) Copyright 2005-2008 Marta Eso and Ted Ralphs. All Rights Reserved. */ 00008 /* */ 00009 /* This application was originally developed by Marta Eso and was modified */ 00010 /* Ted Ralphs (tkralphs@lehigh.edu) */ 00011 /* */ 00012 /* This software is licensed under the Common Public License. Please see */ 00013 /* accompanying file for terms. */ 00014 /* */ 00015 /*===========================================================================*/ 00016 00017 #ifndef _SPP_CG_PARAMS_H 00018 #define _SPP_CG_PARAMS_H 00019 00020 typedef struct SPP_CG_PARAMS{ 00021 double min_violation_clique; 00022 double min_violation_oddhole; 00023 double min_violation_oddantihole; 00024 double min_violation_wheel; 00025 double min_violation_orthocut; 00026 double min_violation_othercut; 00027 00028 int starcl_degree_threshold; /* star cls below this are enumerated */ 00029 int starcl_which_node; 00030 int rowcl_degree_threshold; /* same for row cliques */ 00031 int max_hub_num; /* max num of hubs when lifting odd holes */ 00032 int eval_oh_during_lifting; /* T/F eval oh after every lifted hub */ 00033 }spp_cg_params; 00034 00035 #endif
1.4.7