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_LP_H_ 00018 #define _SPP_LP_H_ 00019 00020 #include "sym_proto.h" 00021 #include "sym_types.h" 00022 #include "sym_dg_params.h" 00023 #include "sym_lp.h" 00024 00025 #include "spp_types.h" 00026 #include "spp_lp_params.h" 00027 00028 typedef struct SPP_LP_TMP { 00029 char *ctmp_2nD; /* length: 2*n*DSIZE */ 00030 double *dtmp_m; /* length rownum */ 00031 double *dtmp_n; 00032 int *itmp_m; 00033 int *itmp_2n; 00034 }spp_lp_tmp; 00035 00036 00037 typedef struct SPP_LP_PROBLEM { 00038 spp_lp_params *par; 00039 spp_lp_tmp *tmp; 00040 col_ordered *cmatrix; 00041 char wname[MAX_NAME_LENGTH +1]; 00042 /* name of window in which frac solns are dispd */ 00043 }spp_lp_problem; 00044 00045 #endif
1.4.7