| 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 _TSP_INS_ROUT_H |
| 18 |
#define _TSP_INS_ROUT_H |
| 19 |
|
| 20 |
#include "heur_types.h" |
| 21 |
#include "sym_proto.h" |
| 22 |
|
| 23 |
int tsp_farthest_ins_from_to PROTO(( |
| 24 |
heur_prob *p, _node *tour, int cost, |
| 25 |
int from_size, int to_size, |
| 26 |
int starter, neighbor *nbtree, |
| 27 |
int *intour, int *last)); |
| 28 |
int tsp_nearest_ins_from_to PROTO(( |
| 29 |
heur_prob *p, _node *tour, int cost, |
| 30 |
int from_size, int to_size, |
| 31 |
int starter, neighbor *nbtree, |
| 32 |
int *intour, int *last)); |
| 33 |
int tsp_closest PROTO(( |
| 34 |
neighbor *nbtree, int *intour, int *last)); |
| 35 |
void tsp_ni_insert_edges PROTO(( |
| 36 |
heur_prob *p, int new_node, neighbor *nbtree, |
| 37 |
int *intour, int *last)); |
| 38 |
int tsp_farthest PROTO(( |
| 39 |
neighbor *nbtree, int *intour, int *last)); |
| 40 |
void tsp_fi_insert_edges PROTO(( |
| 41 |
heur_prob *p, int new_node, neighbor *nbtree, |
| 42 |
int *intour, int *last)); |
| 43 |
int tsp_insert_into_tour PROTO(( |
| 44 |
heur_prob *p, _node *tour, int starter, |
| 45 |
int size, int new_node)); |
| 46 |
|
| 47 |
#endif |