/*--------------/ Asyl Liyakat Hawa Heuristics for the Score-Constrained Strip Packing Problem packing.h /--------------*/ #ifndef PACKING_H #define PACKING_H #include #include using namespace std; int LowerBound(double totalItemWidth, int stripWidth); void MFFD(int numScores, int numItem, int maxItemWidth, int stripWidth, vector &allScores, vector &partners, vector > &adjMatrix, vector > &itemWidths, vector &stripSum, vector > &strip); void PairSmallest(int numScores, int stripWidth, vector &allScores, vector &partners, vector > &adjMatrix, vector > &itemWidths, vector &stripSum, vector > &strip); void MFFDPlus(int tau, int numScores, int numItem, int maxItemWidth, int stripWidth, vector &allScores, vector &partners, vector > &adjMatrix, vector > &itemWidths, vector &stripSum, vector > &strip); void AHCA(int tau, int i1, int j1, int &feasible, vector &allScores, vector &partners, vector > &adjMatrix, vector > &itemWidths, vector &itemDecrease, vector &stripSum, vector > &strip); void InitInstance(int tau, int nScores, vector > &adjMat, vector &scores, vector &order, vector &partnersX); void MCM(int nScores, int &matchSize, vector > &adjMat, vector &partnersX, vector &matchList, vector &cycleVertex); void MPS(int nScores, int &nCycles, vector &partnersX, vector &matchList, vector > &mpStructure); void BR(int &qstar, int matchSize, vector > &adjMat, vector &matchList, vector &cycleVertex, vector &edge, vector > &mpStructure, vector > &C, vector > &S); void CP(int nScores, int nComp, int &feasible, int qstar, int nCycles, vector &partnersX, vector &matchList, vector &cycleVertex, vector &edge, vector > &adjMat, vector > &C, vector > &S, vector &altHam); #endif