/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CLUSTER_HEUR_H #define _CLUSTER_HEUR_H #include "sym_proto.h" #include "vrp_types.h" void cluster_heur PROTO((vrp_problem *vrp, heur_params *heur_par, heurs *ch, int trials,int jobs, int *tids, int *sent)); void generate_starter PROTO((int vertnum, int *starter, int num)); #endif