|
Dip
0.92.4
|

Go to the source code of this file.
Classes | |
| struct | SOR_IntDblT |
| struct | SOR_IntDblArrT |
Typedefs | |
| typedef struct SOR_IntDblT | SOR_IntDbl |
| typedef struct SOR_IntDblArrT | SOR_IntDblArr |
| typedef SOR_IntDblArr * | SOR_IntDblArrPtr |
Functions | |
| SOR_IntDblArrPtr | SOR_IntDblArrNew (int size, int *pstatus) |
| void | SOR_IntDblSwap (SOR_IntDbl *A, SOR_IntDbl *B) |
| void | SOR_IntDblArrPrint (const SOR_IntDblArr *A) |
| void | SOR_IntDblArrFree (SOR_IntDblArrPtr *A) |
| void | KnapsackSortRatioOut (const int n, const double *p, const double *w, double *psort, double *wsort, SOR_IntDbl *ratio) |
| int | KnapsackOptimizeHS (const int n, const double c, double *p, double *w, int *x, double *z, int *pstatus) |
| typedef struct SOR_IntDblT SOR_IntDbl |
| typedef SOR_IntDblArr SOR_IntDblArr |
Definition at line 34 of file UtilKnapsack.h.
| typedef SOR_IntDblArr* SOR_IntDblArrPtr |
Definition at line 35 of file UtilKnapsack.h.
| SOR_IntDblArrPtr SOR_IntDblArrNew | ( | int | size, |
| int * | pstatus | ||
| ) |
Referenced by GAP_Knapsack::GAP_Knapsack().
| void SOR_IntDblSwap | ( | SOR_IntDbl * | A, |
| SOR_IntDbl * | B | ||
| ) |
| void SOR_IntDblArrPrint | ( | const SOR_IntDblArr * | A | ) |
| void SOR_IntDblArrFree | ( | SOR_IntDblArrPtr * | A | ) |
Referenced by GAP_Knapsack::~GAP_Knapsack().
| void KnapsackSortRatioOut | ( | const int | n, |
| const double * | p, | ||
| const double * | w, | ||
| double * | psort, | ||
| double * | wsort, | ||
| SOR_IntDbl * | ratio | ||
| ) |
Referenced by GAP_Knapsack::populateAndSortRatio().
| int KnapsackOptimizeHS | ( | const int | n, |
| const double | c, | ||
| double * | p, | ||
| double * | w, | ||
| int * | x, | ||
| double * | z, | ||
| int * | pstatus | ||
| ) |
Referenced by GAP_Knapsack::solveKnapsack().
1.8.5