// Copyright (C) 2003,.International Business Machines
// Corporation and others,  All Rights Reserved,
#ifndef SbbEnum_H
#define SbbEnim_H

//#define SBBENUM 1 

///ADDG
//#if SBBENIM==1
//-----------------------------------------------------------------------------

/**
   This enumerative constant describes the various objective function value estimate node selection methods, 
 */

enum objEstimate_t{
   /** Best projection estimate*/
   ProE,
   /** Best projection estimate with number of integer infeasibilitiese*/
   ProNumE,
   /** Pseudocost estimate*/
   PseudoE,
  /** Different pseudocost estimate using average */
   DiffPseudoAverE,
  /** Different pseudocost estimate using minimum*/
   DiffPseudoMinE,
  /** Different pseudocost estimate using maximum */
DiffPseudoMaxE};

///////ADDG
 

////////ADDG
//-----------------------------------------------------------------------------

/**
   This enumerative constant describes the various estimate node selection methods, 
 */

enum estimate_t{
 objEstimate_t, 
 /* number of integer infeasibilities             */
 numUnsatisfiedMod=6,
  /* sum  of integer infeasibilities             */
  sumUnsatisfied,
/* Allowed Variable values (AVV)----infinite part */
   AVVInfPart,
   /* AVV --integer part*/
   AVVIntPart, 
  /** Norm estimate */
   NormE,
  /** Norm 2 estimate */
   Norm2E,
  /** Norm3 estimate */
   Norm3E,
  /** Alternate norm  estimate */
   AltNormE,

  /** Alternate norm 2 estimate */
   AltNorm2E,
  /** Alternate norm  3 estimate */
   AltNorm3E,
/*ratio of sum of integer infeasibilities  to number of integer infeasibilities*/
ratioSumToNumUnsatisfiedMod,

/*  weighted sum  of number of integer infeasibilities  to sum of integer infeasibilities*/
weightedSumToNumUnsatisfiedMod



};

 //-----------------------------------------------------------------------------

/**
   This enumerative constant describes the various mpde comparoson stategoes  
 */

enum  comparisonStrategies_t{
 estimate_t,  
 /* number of integer infeasibilities */
 oriNumUnsatisfied=18,
/* de[th first search*/
dfs,
/* breadth fist search */
breadth,
/* best first search--objective */
bfs,
/* RANDOM chouce */
randomChoice,
/*heuristic estimate guessedObjectiveEstimate*/
heuristicEstimate,
/* DEFAULT */
defaultWay,
/* user-before solution numberUnsatisfied and depth then objective and numberUnsatisfied combination */
user,
/** user-before solution sumnsatisfied and depth then objective and sumnsatisfied combination */
userSumUnsatisfied};
 


#endif




//#endif




//#define SBBENUM 2