| 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 |
/* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ |
| 8 |
/* */ |
| 9 |
/* This application was developed by Ted Ralphs ([email protected]) */ |
| 10 |
/* */ |
| 11 |
/* This software is licensed under the Eclipse Public License. Please see */ |
| 12 |
/* accompanying file for terms. */ |
| 13 |
/* */ |
| 14 |
/*===========================================================================*/ |
| 15 |
|
| 16 |
#ifndef _VRP_MASTER_FUNCTIONS_H |
| 17 |
#define _VRP_MASTER_FUNCTIONS_H |
| 18 |
|
| 19 |
/* SYMPHONY include files */ |
| 20 |
#include "sym_proto.h" |
| 21 |
|
| 22 |
/* VRP include files */ |
| 23 |
#include "vrp_types.h" |
| 24 |
#ifdef COMPILE_HEURS |
| 25 |
#include "heur_types.h" |
| 26 |
#include "lb_types.h" |
| 27 |
#endif |
| 28 |
|
| 29 |
int is_same_edge PROTO((const void *ed0, const void *ed1)); |
| 30 |
void delete_dup_edges PROTO((small_graph *g)); |
| 31 |
void broadcast PROTO((vrp_problem *vrp, int *tids, int jobs)); |
| 32 |
int *create_edge_list PROTO((vrp_problem *vrp, int *varnum, char which_edges)); |
| 33 |
|
| 34 |
#endif |
| 35 |
|
| 36 |
|