Home
last modified time | relevance | path

Searched refs:nsolitems (Results 1 – 5 of 5) sorted by relevance

/dports/math/SCIP/scip-7.0.3/tests/src/cons/knapsack/
H A Dsolveknapsackapprox.c34 static int nsolitems; variable
52 nsolitems = nnonsolitems = 0; in randomDataInit()
93 nsolitems = nnonsolitems = 0; in setup()
110 …cr_assert_eq(nsolitems + nnonsolitems, nitems, "Mismatch in the number of solution items: %d + %d … in testassignment()
116 for( i = 0; i < nsolitems; ++i ) in testassignment()
137 …cip, nitems, weights, profits, capacity, items, solitems, nonsolitems, &nsolitems, &nnonsolitems, … in callAndTestSolveKnapsackApproximately()
185 cr_assert_eq(nsolitems, nitems, "Not all items were selected from trivial random data\n");
258 cr_assert_eq(nsolitems, 49, "Wrong number of solution items");
260 expectedprofit = ((nitems + 1)/ 3.0) * nsolitems - (SCIP_Real)(nsolitems - 1)*nsolitems / 6.0;
H A Dsolveknapsackexactly.c42 static int nsolitems = -1; variable
125 cr_assert( nsolitems == 0 );
150 cr_assert( nsolitems == 2 );
177 cr_assert( nsolitems == 2 );
199 cr_assert( nsolitems == 1 );
225 cr_assert( nsolitems == 2 );
248 cr_assert( nsolitems == 2 );
274 cr_assert( nsolitems == 4 );
305 …cr_assert( nsolitems == 750 ); /* the 500 latter items with higher profit, and 250 of the less pro…
307 cr_assert( checkSetContainment(&items[nitems/2], solitems, nitems / 2, nsolitems) );
[all …]
/dports/math/SCIP/scip-7.0.3/src/scip/
H A Dcons_knapsack.h216 …int* nsolitems, /**< pointer to store number of items in solution, or NU…
237 …int* nsolitems, /**< pointer to store number of items in solution, or NU…
H A Dcuts.c6078 *nsolitems = 0; in SCIPsolveKnapsackApproximatelyLT()
6107 (*nsolitems)++; in SCIPsolveKnapsackApproximatelyLT()
6122 (*nsolitems)++; in SCIPsolveKnapsackApproximatelyLT()
6167 assert(nsolitems >= 0); in buildFlowCover()
6176 for( j = 0; j < nsolitems; j++ ) in buildFlowCover()
6310 int nsolitems; in getFlowCover() local
6520 nsolitems = -1; in getFlowCover()
6584 assert(nsolitems != -1); in getFlowCover()
6683 int nsolitems; in getFlowCover() local
6865 nsolitems = -1; in getFlowCover()
[all …]
H A Dcons_knapsack.c1099 assert(nsolitems != NULL); in SCIPsolveKnapsackExactly()
1104 *nsolitems = 0; in SCIPsolveKnapsackExactly()
1243 solitems[(*nsolitems)++] = myitems[p]; in SCIPsolveKnapsackExactly()
1356 solitems[(*nsolitems)++] = myitems[l]; in SCIPsolveKnapsackExactly()
1490 solitems[(*nsolitems)++] = myitems[j]; in SCIPsolveKnapsackExactly()
1505 solitems[(*nsolitems)++] = myitems[j]; in SCIPsolveKnapsackExactly()
1516 assert(*nsolitems + *nnonsolitems == nitems); in SCIPsolveKnapsackExactly()
1567 *nsolitems = 0; in SCIPsolveKnapsackApproximately()
1590 solitems[(*nsolitems)++] = items[j]; in SCIPsolveKnapsackApproximately()
6695 int nsolitems; in dualPresolving() local
[all …]