RetroSearch Browse

);

332

(*conshdlrdata)->feasST = 0;

333

(*conshdlrdata)->nDiscardSols = 0;

334

(*conshdlrdata)->nNonSparseSols = 0;

335

(*conshdlrdata)->solutions =

;

336

(*conshdlrdata)->nsolutions = 0;

337

(*conshdlrdata)->ssolutions = 0;

341

(*conshdlrdata)->cutoffSolution =

;

342

(*conshdlrdata)->warning =

;

343

(*conshdlrdata)->hashmap =

;

344

(*conshdlrdata)->allvars =

;

345

(*conshdlrdata)->vars =

;

346

(*conshdlrdata)->nallvars = 0;

347

(*conshdlrdata)->nvars = 0;

348

(*conshdlrdata)->continuous =

;

367

conshdlrdata->active =

;

369 SCIPdebugMsg

(

"check solution in original space before counting\n"

);

385

conshdlrdata->active =

;

388#define checkSolutionOrig(scip, sol, conshdlrdata) 411 for

(

= 0;

< nheuristics && valid; ++

)

420 "At least one heuristic is not turned off! Heuristic solutions are currently not accepted while couting.\n"

);

471

assert( sol !=

);

472

assert( conshdlrdata !=

);

474

vars = conshdlrdata->vars;

475

nvars = conshdlrdata->nvars;

480 for

( v = 0; v < nvars; ++v )

484

assert( var !=

);

533

assert( sol !=

);

534

assert( conshdlrdata !=

);

536

vars = conshdlrdata->vars;

537

nvars = conshdlrdata->nvars;

539

nconsvars = nvars * 2;

549 for

( v = nvars - 1; v >= 0; --v )

564

bounds[nconsvars] = 1;

569

bounds[nconsvars] = 0;

589

bounds[nconsvars] = lb + 1.0;

594

bounds[nconsvars] = ub - 1.0;

599

bounds[nconsvars] = valueInt + 1.0;

600

consvars[nconsvars] = var;

603

bounds[nconsvars] = valueInt - 1.0;

607

consvars[nconsvars] = var;

614 if

( nvars == nbinvars )

616 for

( v = nbinvars - 1; v >= 0; --v )

631

nconsvars, consvars, boundtypes, bounds,

666 if

( conshdlrdata->nsolutions == conshdlrdata->ssolutions )

668 if

( conshdlrdata->ssolutions == 0 )

670

conshdlrdata->ssolutions = 100;

675

assert( conshdlrdata->ssolutions < INT_MAX / 2);

676

conshdlrdata->ssolutions *= 2;

680

assert( conshdlrdata->nsolutions < conshdlrdata->ssolutions );

683

nvars = conshdlrdata->nvars;

685 SCIPdebugMsg

(

"creating solution number %d\n"

, conshdlrdata->nsolutions);

689

assert(solution !=

);

693

assert(ubvalues !=

);

694

assert(lbvalues !=

);

696 for

( v = nvars - 1; v >= 0; --v )

700

var = conshdlrdata->vars[v];

701

assert(var !=

);

711

ubvalues[v] = lbvalues[v];

718

conshdlrdata->solutions[conshdlrdata->nsolutions] = solution;

719

conshdlrdata->nsolutions++;

736

assert( sol !=

);

737

assert( conshdlrdata !=

);

738

assert( result !=

);

755 SCIPdebugMsg

(

"counts number of solutions represented through the given one\n"

);

785 for

( v = 0; v < nvars; ++v )

815

conshdlrdata->feasST++;

817 if

( conshdlrdata->collect )

822 addInt

(&conshdlrdata->nsols, &newsols);

825 else if

(!conshdlrdata->discardsols)

827 SCIP_CALL

( conshdlrdata->cutoffSolution(

, sol, conshdlrdata) );

828 addOne

(&conshdlrdata->nsols);

829

conshdlrdata->nNonSparseSols++;

830 if

( conshdlrdata->collect )

836

conshdlrdata->nDiscardSols++;

866

assert( conshdlr !=

);

871

assert( conss !=

);

873

(*satisfied) =

;

876 for

( ; c >= 0 && nconss > 0 && (*satisfied); --c )

890 for

( v = 0; v < nvars && !fixedone; ++v )

902

(*satisfied) =

;

941

assert( conshdlr !=

);

946

assert( conss !=

);

948

(*satisfied) =

;

951 for

( ; c >= 0 && nconss > 0 && (*satisfied); --c )

967

capa = capacity + 0.1;

969 for

( v = nvars - 1; v >= 0 && capa >= 0 ; --v )

976

assert( weights[v] >= 0);

985 else if

( weights[v] >= 1 )

998

(*satisfied) =

;

1034

assert( conshdlr !=

);

1039

assert( conss !=

);

1041

(*satisfied) =

;

1044 for

( ; c >= 0 && nconss > 0 && (*satisfied); --c )

1050

satisfiedbound =

;

1058 for

( v = nvars-1; v >= 0 && !satisfiedbound; --v )

1072 if

( !satisfiedbound )

1076

(*satisfied) =

;

1113

assert( conshdlr !=

);

1118

assert( conss !=

);

1120

(*satisfied) =

;

1123 for

( ; c >= 0 && nconss > 0 && (*satisfied); --c )

1151

(*satisfied) =

;

1183

assert( sol !=

);

1184

assert( feasible !=

);

1192

assert(conshdlrs !=

);

1195 for

(

= nconshdlrs ;

>= 0 ; --

)

1197

conshdlr = conshdlrs[

];

1198

assert( conshdlr !=

);

1210 SCIPdebugMsg

(

"constraint handler %s has %d active constraint(s)\n"

1236 SCIPdebugMsg

(

"a <bounddisjunction> constraint cannot be disabled\n"

);

1251 SCIPdebugMsg

(

"sparse solution is infeasible since the following constraint (and maybe more) is(/are) enabled\n"

);

1281

assert( sol !=

);

1282

assert( conshdlrdata !=

);

1283

assert( result !=

);

1312 for

( v = 0; v < nvars; ++v )

1315 SCIPdebugMsg

(

"variables <%s> Local Bounds are [%g,%g] Global Bounds are [%g,%g]\n"

1327 addOne

(&conshdlrdata->nsols);

1328

conshdlrdata->nNonSparseSols++;

1332 if

( conshdlrdata->collect )

1340 if

( conshdlrdata->continuous )

1342 SCIP_CALL

( conshdlrdata->cutoffSolution(

, sol, conshdlrdata) );

1348 else if

( conshdlrdata->sparsetest )

1358 if

( conshdlrdata->sollimit > -1 && (!valid || conshdlrdata->sollimit <= nsols) )

1387

assert(conshdlrdata !=

);

1390 if

( conshdlrdata->active )

1395

assert(conshdlr !=

);

1407#define consCopyCountsols NULL 1415

assert(conshdlr !=

);

1420

assert(conshdlrdata !=

);

1423 freeInt

(&conshdlrdata->nsols);

1425

assert( conshdlrdata->solutions ==

);

1426

assert( conshdlrdata->nsolutions == 0 );

1427

assert( conshdlrdata->ssolutions == 0 );

1441

assert( conshdlr !=

);

1445

assert(conshdlrdata !=

);

1448

conshdlrdata->feasST = 0;

1449

conshdlrdata->nDiscardSols = 0;

1450

conshdlrdata->nNonSparseSols = 0;

1451 setInt

(&conshdlrdata->nsols, 0LL);

1453

conshdlrdata->solutions =

;

1454

conshdlrdata->nsolutions = 0;

1455

conshdlrdata->ssolutions = 0;

1457 if

( conshdlrdata->active )

1475 for

( v = 0; v < norigvars; ++v )

1479

assert(nallvars < conshdlrdata->nallvars);

1482

assert(conshdlrdata->allvars[nallvars] !=

);

1487 if

( strncmp(

SCIPvarGetName

(conshdlrdata->allvars[nallvars]),

"t_andresultant_"

, strlen(

"t_andresultant_"

)) != 0 )

1496

assert(nallvars == conshdlrdata->nallvars);

1513

assert( conshdlr !=

);

1517

assert(conshdlrdata !=

);

1520 for

( v = conshdlrdata->nvars - 1; v >= 0; --v )

1525 if

( conshdlrdata->hashmap !=

)

1533

conshdlrdata->nvars = 0;

1535 if

( conshdlrdata->allvars !=

)

1538 for

( v = 0; v < conshdlrdata->nallvars; ++v )

1540 if

( strncmp(

SCIPvarGetName

(conshdlrdata->allvars[v]),

"t_andresultant_"

, strlen(

"t_andresultant_"

)) != 0 )

1550

conshdlrdata->nallvars = 0;

1553 if

( conshdlrdata->nsolutions > 0 )

1555 for

( s = conshdlrdata->nsolutions - 1; s >= 0 ; --s )

1561

conshdlrdata->nsolutions = 0;

1562

conshdlrdata->ssolutions = 0;

1564

assert( conshdlrdata->solutions ==

);

1566

conshdlrdata->continuous =

;

1568

assert( conshdlrdata->solutions ==

);

1569

assert( conshdlrdata->nsolutions == 0 );

1570

assert( conshdlrdata->ssolutions == 0 );

1586

assert( conshdlr !=

);

1590

assert(conshdlrdata !=

);

1597

assert(conshdlrdata->nsolutions == 0);

1598

assert(conshdlrdata->solutions ==

);

1604 for

( v = conshdlrdata->nvars - 1; v >= 0; --v )

1618

conshdlrdata->nvars = v + 1;

1624 for

( v = conshdlrdata->nvars - 1; v >= 0; --v )

1648 for

( v = conshdlrdata->nvars - 1; v >= 0; --v )

1657

conshdlrdata->cutoffSolution = addBinaryCons;

1659

conshdlrdata->cutoffSolution = addIntegerCons;

1672

assert(conshdlr !=

);

1673

assert(nconss == 0);

1677

assert(conshdlrdata !=

);

1679 if

( conshdlrdata->active && restart )

1681 SCIPerrorMessage

(

"When collecting and counting solutions restarts need to be disabled (presolving/maxrestarts = 0).\n"

);

1695 SCIPdebugMsg

(

"method SCIP_DECL_CONSENFOLP(consEnfolpCountsols)\n"

);

1698

assert( conshdlr !=

);

1699

assert( nconss == 0 );

1702

assert( conshdlrdata !=

);

1704 if

( conshdlrdata->active )

1706 if

( !solinfeasible )

1732 SCIPdebugMsg

(

"method SCIP_DECL_CONSENFORELAX(consEnfolpCountsols)\n"

);

1735

assert( conshdlr !=

);

1736

assert( nconss == 0 );

1739

assert( conshdlrdata !=

);

1741 if

( conshdlrdata->active )

1743 if

( !solinfeasible )

1764 SCIPdebugMsg

(

"method SCIP_DECL_CONSENFOPS(consEnfopsCountsols)\n"

);

1767

assert( conshdlr !=

);

1768

assert( nconss == 0 );

1771

assert( conshdlrdata !=

);

1773 if

( conshdlrdata->active )

1775 if

( !solinfeasible )

1804 SCIPdebugMsg

(

"method SCIP_DECL_CONSCHECK(consCheckCountsols)\n"

);

1807

assert( conshdlrdata !=

);

1809 if

( conshdlrdata->active )

1814 else if

( !conshdlrdata->warning )

1816 SCIPwarningMessage

(

"a non-trivial solution comes in over <SCIP_DECL_CONSCHECK(consCheckCountsols)>; currently these solutions are ignored.\n"

);

1817

conshdlrdata->warning =

;

1849 if

( usesymmetry != 0 )

1851 int

symcomptiming = 2;

1858 else if

( usesymmetry == 2 )

1866 SCIPerrorMessage

(

"Symmetry handling and solution counting are not compatible. "

1867 "You might want to disable symmetry by setting parameter <misc/usesymmetry> to 0.\n"

);

1872 SCIPwarningMessage

(

"Symmetry handling has been deactivated since it is not compatible with counting.\n"

);

1942 int

displayprimalbound;

1954 if

( nrestarts != 0 )

1969 if

( usesymmetry != 0 )

1971 int

symcomptiming = 2;

1978 else if

( usesymmetry == 2 )

1986 SCIPerrorMessage

(

"Symmetry handling and solution counting are not compatible. "

1987 "You might want to disable symmetry by setting parameter <misc/usesymmetry> to 0.\n"

);

1992 SCIPwarningMessage

(

"Symmetry handling has been deactivated since it is not compatible with counting.\n"

);

2028 "Problem contains continuous variables (after presolving). Counting projection to integral variables!\n"

);

2033 if

( displayprimalbound != 0 )

2038 if

( displaygap != 0 )

2045 if

( displayprimalbound != 2 )

2050 if

( displayprimalbound != 2 )

2074 if

( requiredsize > buffersize )

2080

assert( buffersize >= requiredsize );

2091 if

( displayprimalbound != 0 )

2095 if

( displaygap != 0 )

2101 if

( displaysols != 2 )

2105 if

( displayfeasST != 2 )

2152

assert(var1 !=

);

2153

assert(var2 !=

);

2191

assert(file !=

);

2192

assert(hashmap !=

);

2193

assert(allvars !=

|| nallvars == 0);

2194

assert(activevars !=

|| nactivevars == 0);

2195

assert(sols !=

|| nsols == 0);

2205 for

( s = 0; s < nsols; ++s )

2207

sparsesol = sols[s];

2208

assert(sparsesol !=

);

2226 for

( v = 0; v < nallvars; ++v )

2235

vars[0] = allvars[v];

2241

assert(requiredsize <= nallvars);

2242

assert(nvars <= nactivevars);

2244

realvalue = constant;

2246 for

( i = 0; i < nvars; ++i )

2250

assert(0 <= idx && idx < nactivevars);

2251

assert(activevars[idx] == vars[i]);

2254

realvalue +=

scalars

[i] * sol[idx];

2321

assert( conshdlr !=

);

2324

assert( conshdlrdata !=

);

2326

nsparsesols = conshdlrdata->nsolutions;

2340 if

( requiredsize > buffersize )

2342

buffersize = requiredsize;

2347

assert( buffersize >= requiredsize );

2352 else if

( nsols == 0 )

2356 else if

( nsparsesols == 0 )

2358 SCIPdialogMessage

(

"there is no solution collect (set parameter <constraints/countsols/collect> to TRUE)\n"

);

2369

*nextdialog =

;

2375 if

( filename[0] !=

'\0'

)

2377

file = fopen(filename,

"w"

);

2396

nvars = conshdlrdata->nvars;

2397

sparsesols = conshdlrdata->solutions;

2417

assert(norigvars == conshdlrdata->nallvars);

2427 SCIPsortDownPtrPtr

((

void

**)allvars, (

void

**)origvars, varCompProbindex, norigvars);

2434 for

( v = 0; v < norigvars; ++v )

2441

assert(transvar !=

);

2442

assert(transvar == allvars[v]);

2451

retcode =

writeExpandedSolutions

(

, file, allvars, conshdlrdata->nallvars, conshdlrdata->vars, nvars, conshdlrdata->hashmap, sparsesols, nsparsesols);

2501 "count"

"count number of feasible solutions"

) );

2510 "countpresolve"

"presolve instance before counting number of feasible solutions"

) );

2521

assert(submenu !=

);

2527 "allsolutions"

"write all counted primal solutions to file"

) );

2549

assert(disp !=

);

2555

assert( conshdlr !=

);

2582

assert(disp !=

);

2588

assert( conshdlr !=

);

2614 char

gmpversion[20];

2623

consEnfolpCountsols, consEnfopsCountsols, consCheckCountsols, consLockCountsols,

2626

assert(conshdlr !=

);

2640 "is the constraint handler active?"

2644 "should the sparse solution test be turned on?"

2648 "is it allowed to discard solutions?"

2652 "should the solutions be collected?"

2656 "counting stops, if the given number of solutions were found (-1: no limit)"

2676

(void)

SCIPsnprintf

(gmpversion, (

int

)

sizeof

(gmpversion),

"MPIR %s"

, mpir_version);

2680

(void)

SCIPsnprintf

(gmpversion, (

int

)

sizeof

(gmpversion),

"GMP %s"

, gmp_version);

2743

assert( conshdlr !=

);

2746

assert( conshdlrdata !=

);

2765

assert( conshdlr !=

);

2768

assert( conshdlrdata !=

);

2774

assert(0 <= (

int

) (mpz_sizeinbase( conshdlrdata->nsols, 10 ) + 2));

2775

*requiredsize = (int) (mpz_sizeinbase( conshdlrdata->nsols, 10 ) + 2);

2776 if

( *requiredsize <= buffersize)

2777 toString

(conshdlrdata->nsols, buffer, buffersize);

2779 if

( conshdlrdata->nsols < pow(10.0, (

double

)buffersize) )

2781 toString

(conshdlrdata->nsols, buffer, buffersize);

2782

*requiredsize = (int)strlen(*buffer);

2802

assert( conshdlr !=

);

2805

assert( conshdlrdata !=

);

2807 return

conshdlrdata->feasST;

2834

assert( conshdlr !=

);

2837

assert( conshdlrdata !=