/*===========================================================================*/
/*                                                                           */
/* 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 VRP_HEURS_H
#define VRP_HEURS_H

#include "vrp_const.h"
#include "exchange.h"
#include "exchange2.h"
#include "farnear_ins.h"
#include "farthest_ins.h"
#include "nearest_ins.h"
#include "mst.h"
#include "near_cluster.h"
#include "savings.h"
#include "savings2.h"
#include "savings3.h"
#include "sweep.h"
#include "tsp_fi.h"
#include "tsp_fini.h"
#include "tsp_ni.h"

#endif
