| 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 Vehicle Routing Problem and the Traveling Salesman Problem. */ |
| 6 |
/* */ |
| 7 |
/* This application was developed by Ted Ralphs ([email protected]) */ |
| 8 |
/* This file was modified by Ali Pilatin January, 2005 ([email protected]) */ |
| 9 |
/* */ |
| 10 |
/* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ |
| 11 |
/* */ |
| 12 |
/* This software is licensed under the Eclipse Public License. Please see */ |
| 13 |
/* accompanying file for terms. */ |
| 14 |
/* */ |
| 15 |
/*===========================================================================*/ |
| 16 |
|
| 17 |
#ifndef _MST_INS_ROUT_H |
| 18 |
#define _MST_INS_ROUT_H |
| 19 |
|
| 20 |
#include "sym_proto.h" |
| 21 |
#include "lb_types.h" |
| 22 |
#include "heur_types.h" |
| 23 |
|
| 24 |
int make_k_tree PROTO((lb_prob *p, int *tree, int *lamda, int k)); |
| 25 |
int closest PROTO((neighbor *nbtree, int *intree, int *last, int *host)); |
| 26 |
void ni_insert_edges PROTO((lb_prob *p, int new_node, neighbor *nbtree, |
| 27 |
int *intree, int *last, int *lamda, int mu)); |
| 28 |
int new_lamda PROTO((lb_prob *p, int upper_bound, int cur_bound, int *lamda, |
| 29 |
int numroutes, int *tree, edge_data *cur_edges, int alpha)); |
| 30 |
|
| 31 |
#endif |