TSP_DecompApp.h

Go to the documentation of this file.

//===========================================================================//
// This file is part of the Decomp Solver Framework.                         //
//                                                                           //
// Decomp is distributed under the Common Public License as part of the      //
// COIN-OR repository (http://www.coin-or.org).                              //
//                                                                           //
// Authors: Matthew Galati, SAS Institute Inc. (matthew.galati@sas.com)      //
//          Ted Ralphs, Lehigh University (ted@lehigh.edu)                   //
//          Jiadong Wang, Lehigh University (jiw408@lehigh.edu)              //
//                                                                           //
// Copyright (C) 2002-2019, Lehigh University, Matthew Galati, and Ted Ralphs//
// All Rights Reserved.                                                      //
//===========================================================================//

#ifndef TSP_DECOMPAPP_INCLUDED
#define TSP_DECOMPAPP_INCLUDED

//===========================================================================//
#include "Decomp.h"
#include "DecompApp.h"
#include "TSP_Instance.h"
#include "TSP_Param.h"
//===========================================================================//

// --------------------------------------------------------------------- //
class TSP_DecompApp : public DecompApp {
private:
   const string m_classTag;

   TSP_Param m_appParam;  

   TSP_Instance m_tsp;

   double * m_objective;

   vector<DecompConstraintSet*> m_models;
   
public:
   /* @name Inherited (from virtual) methods. */

   virtual DecompSolverStatus solveRelaxed(const int          whichBlock,
                       const double     * redCostX,
                       const double       convexDual,
                       DecompVarList    & varList);
   
   virtual int generateCuts(const double  * x, 
                DecompCutList & newCuts);
   
   virtual bool APPisUserFeasible(const double * x, 
                  const int      n_cols,
                  const double   tolZero);
   virtual void printOriginalColumn(const int   index, 
                    ostream   * os) const;
   
      
private: 
   void initializeApp();

   void createModels();
   
   void createModel2Match(DecompConstraintSet * modelCS);
   
   void createModelTrivialSEC(DecompConstraintSet * modelCS);

   int generateCutsSubtour(DecompCutList & newCuts);

   void solveOneTree(const double               * cost, 
                     const double                 alpha,
                     vector< pair<int,double> > & edge_cost,
                     DecompVarList              & vars,
                     Graph                      & g);
   
public:
   TSP_DecompApp(UtilParameters & utilParam) : 
      DecompApp(utilParam),
      m_classTag("TSP-APP"),
      m_objective(NULL)
   {
      //---
      //--- get application parameters
      //---
      m_appParam.getSettings(utilParam);
      if(m_appParam.LogLevel >= 1)
     m_appParam.dumpSettings();
      
      initializeApp();         
   }
   
   virtual ~TSP_DecompApp() {
      UtilDeleteVectorPtr(m_models);
      UTIL_DELARR(m_objective);
   };
};

#endif