00001 /*===========================================================================*/ 00002 /* */ 00003 /* This file is part of a demonstration application for use with the */ 00004 /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ 00005 /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ 00006 /* */ 00007 /* (c) Copyright 2000-2008 Ted Ralphs. All Rights Reserved. */ 00008 /* */ 00009 /* This application was developed by Ted Ralphs (tkralphs@lehigh.edu) */ 00010 /* */ 00011 /* This software is licensed under the Common Public License. Please see */ 00012 /* accompanying file for terms. */ 00013 /* */ 00014 /*===========================================================================*/ 00015 00016 #ifndef _VRP_MASTER_FUNCTIONS_H 00017 #define _VRP_MASTER_FUNCTIONS_H 00018 00019 /* SYMPHONY include files */ 00020 #include "sym_proto.h" 00021 00022 /* VRP include files */ 00023 #include "vrp_types.h" 00024 #ifdef COMPILE_HEURS 00025 #include "heur_types.h" 00026 #include "lb_types.h" 00027 #endif 00028 00029 int is_same_edge PROTO((const void *ed0, const void *ed1)); 00030 void delete_dup_edges PROTO((small_graph *g)); 00031 void broadcast PROTO((vrp_problem *vrp, int *tids, int jobs)); 00032 int *create_edge_list PROTO((vrp_problem *vrp, int *varnum, char which_edges)); 00033 00034 #endif 00035 00036
1.4.7