| 1 |
#ifndef _DECOMP_LOWER_BOUND_H |
| 2 |
#define _DECOMP_LOWER_BOUND_H |
| 3 |
|
| 4 |
#include "sym_proto.h" |
| 5 |
#include "cg_user.h" |
| 6 |
|
| 7 |
struct DBL_NEIGHBOR; |
| 8 |
struct DBL_EDGE_DATA; |
| 9 |
|
| 10 |
double decomp_lower_bound PROTO((cg_vrp_spec *vrp, double *edge_costs, |
| 11 |
int *x, int adjust, int mult)); |
| 12 |
double decomp_make_k_tree PROTO((cg_vrp_spec *vrp, double *edge_costs, |
| 13 |
int *tree, int k)); |
| 14 |
int decomp_closest PROTO((struct DBL_NEIGHBOR *nbtree, int *intree, int *last, |
| 15 |
int *host)); |
| 16 |
void decomp_insert_edges PROTO((cg_vrp_spec *vrp, double *edge_costs, |
| 17 |
int new_node, struct DBL_NEIGHBOR *nbtree, |
| 18 |
int *intree, int *last, int mu)); |
| 19 |
int decomp_new_lamda PROTO((cg_vrp_spec *vrp, int upper_bound, int cur_bound, |
| 20 |
int *lamda, int numroutes, int *tree, |
| 21 |
struct DBL_EDGE_DATA *cur_edges, int alpha)); |
| 22 |
|
| 23 |
#endif |