| 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_CG_FUNCTIONS_H |
| 18 |
#define _SPP_CG_FUNCTIONS_H |
| 19 |
|
| 20 |
int find_violated_odd_holes PROTO((spp_cg_problem *spp, double etol)); |
| 21 |
double find_chordless_oh PROTO((spp_cg_problem *spp, frac_graph *fgraph, |
| 22 |
int u, int w, int *oh)); |
| 23 |
void min_path_to_root PROTO((spp_cg_problem *spp, frac_graph *fgraph, |
| 24 |
int u, int *path_u, double *pcost)); |
| 25 |
double lift_nonviolated_odd_hole PROTO((spp_cg_problem *spp, int oh_len, |
| 26 |
int *oh, double lhs_oh, int *phub_len, |
| 27 |
int *hubs, int *hub_coef)); |
| 28 |
int max_lhs_of_lifted_odd_hole PROTO((spp_cg_problem *spp, int oh_len, |
| 29 |
int *oh, int hub, int hub_len, int *hubs, |
| 30 |
int *hub_coef, char *label, int pos)); |
| 31 |
int find_violated_odd_antiholes PROTO((spp_cg_problem *spp, double etol)); |
| 32 |
double lift_nonviolated_odd_antihole PROTO((spp_cg_problem *spp, int oah_len, |
| 33 |
int *oah, double lhs_oah, |
| 34 |
int *phub_len, int *hubs, |
| 35 |
int *hub_coef, double etol)); |
| 36 |
void translate_cut_to_indices PROTO((spp_cg_problem *spp, cut_data *cut)); |
| 37 |
void rotate_odd_hole PROTO((int length, int *indices, int *itmp)); |
| 38 |
|
| 39 |
#endif |