| 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 Set Partitioning Problem. */ |
| 6 |
/* */ |
| 7 |
/* (c) Copyright 2005-2013 Marta Eso and Ted Ralphs. All Rights Reserved. */ |
| 8 |
/* */ |
| 9 |
/* This application was originally developed by Marta Eso and was modified */ |
| 10 |
/* Ted Ralphs ([email protected]) */ |
| 11 |
/* */ |
| 12 |
/* This software is licensed under the Eclipse Public License. Please see */ |
| 13 |
/* accompanying file for terms. */ |
| 14 |
/* */ |
| 15 |
/*===========================================================================*/ |
| 16 |
|
| 17 |
#ifndef _SPP_LP_FUNCTIONS_H |
| 18 |
#define _SPP_LP_FUNCTIONS_H |
| 19 |
|
| 20 |
#include "sym_proto.h" |
| 21 |
|
| 22 |
#include "spp.h" |
| 23 |
|
| 24 |
void spp_init_lp PROTO((spp_lp_problem *spp)); |
| 25 |
void spp_free_lp_tmp PROTO((spp_lp_problem *spp)); |
| 26 |
void disp_where_cut_is_from PROTO((int from)); |
| 27 |
void display_cut_in_lp PROTO((spp_lp_problem *spp, cut_data *cut, |
| 28 |
double violation)); |
| 29 |
void cut_to_row PROTO((spp_lp_problem *spp, int n, var_desc **vars, |
| 30 |
cut_data *cut, int *pnzcnt, int **pmatind, |
| 31 |
double **pmatval)); |
| 32 |
void lift_cut_in_lp PROTO((spp_lp_problem *spp, int from, int n, |
| 33 |
var_desc **vars, cut_data **cut, |
| 34 |
int *plifted_cutnum, cut_data ***plifted_cuts)); |
| 35 |
int extend_clique_greedily PROTO((col_ordered *cmatrix, int cl_length, |
| 36 |
int *cl_indices, int length, int *indices)); |
| 37 |
char lift_clique PROTO((spp_lp_problem *spp, int n, var_desc **vars, |
| 38 |
double *dj, double dj_threshold, cut_data *cut, |
| 39 |
cut_data *new_cut, int strategy)); |
| 40 |
|
| 41 |
#endif |