13 #ifndef GAP_INSTANCE_INCLUDED
14 #define GAP_INSTANCE_INCLUDED
17 #include "UtilMacros.h"
79 void readInstance(
string& filename);
80 void readBestKnown(
string& fileName,
81 string& instanceName);
89 m_isProvenOptimal =
false;
90 m_bestKnownLB = -1.e20;
91 m_bestKnownUB = 1.e20;
96 return (i * m_nTasks) + j;
100 return make_pair(index / m_nTasks, index % m_nTasks);
104 return m_bestKnownLB;
107 return m_bestKnownUB;
121 readInstance(fileName);
pair< int, int > getIndexInv(const int index) const
~GAP_Instance()
Default constructor.
const int getNTasks() const
const int * getWeight() const
GAP_Instance(string &fileName)
Default constructor.
GAP_Instance()
Default constructor.
const double getBestKnownLB() const
const int getIndexIJ(const int i, const int j) const
const int getNMachines() const
const int * getProfit() const
bool m_isProvenOptimal
GAP_Instance best known LB/UB.
int m_nTasks
GAP_Instance problem instance data.
const double getBestKnownUB() const
const int * getCapacity() const