| 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_CLIQUE_H |
| 18 |
#define _SPP_CG_CLIQUE_H |
| 19 |
|
| 20 |
int find_violated_star_cliques PROTO((spp_cg_problem *spp, double etol)); |
| 21 |
void spp_delete_node PROTO((spp_cg_problem *spp, int del_ind, |
| 22 |
int *pcurrent_nodenum, int *current_indices, |
| 23 |
int *current_degrees, double *current_values)); |
| 24 |
int choose_next_node PROTO((spp_cg_problem *spp, int current_nodenum, |
| 25 |
int *current_indices, int *current_degrees, |
| 26 |
double *current_values)); |
| 27 |
int find_violated_row_cliques PROTO((spp_cg_problem *spp, double etol)); |
| 28 |
int enumerate_maximal_cliques PROTO((spp_cg_problem *spp, int pos, double etol)); |
| 29 |
int greedy_maximal_clique PROTO((spp_cg_problem *spp, cut_data *new_cut, |
| 30 |
int length, int *indices, int pos, double etol)); |
| 31 |
#endif |