RetroSearch Browse

);

213

assert(problem->scip !=

);

215

block = &problem->blocks[problem->nblocks];

221

block->

number

= problem->nblocks;

239

assert(block !=

);

267

assert(problem !=

);

270

assert(*problem !=

);

280

(*problem)->scip =

;

281

(*problem)->nblocks = 0;

296

assert(problem !=

);

297

assert(*problem !=

);

299 scip

= (*problem)->scip;

303 for

( c = nblocks - 1; c >= 0; --c )

307 if

( (*problem)->blocks !=

)

388

assert(subscip !=

);

389

assert(conss !=

);

390

assert(consmap !=

);

391

assert(success !=

);

400 for

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

402

assert(conss[i] !=

);

421 if

( !(*success) || newcons ==

)

450

assert(block !=

);

451

assert(varmap !=

);

452

assert(consmap !=

);

453

assert(conss !=

);

454

assert(success !=

);

457

assert(problem !=

);

459 scip

= problem->scip;

485 for

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

486

block->

subvars

[i] = subscipvars[i];

528

assert((*problem)->blocks !=

);

533 for

(

= 0;

< nblocks;

++ )

540 for

(

= 0;

< nblocks;

++ )

542

block = &(*problem)->blocks[

];

547

blockconss = &(sortedconss[nhandledconss]);

548

nblockconss = consssize[

+ 1];

554

nhandledconss += nblockconss;

586

assert(vars !=

);

587

assert(sortedconss !=

);

588

assert(varlabels !=

);

589

assert(conslabels !=

);

595 SCIPdebugMsg

(

"try to assign %d linking constraints\n"

, nlinkconss);

630

assert(subscip !=

);

631

assert(block !=

);

642

sol = sols[nsols - 1];

655 for

( c = 0; c < block->

ncoupling

; c++ )

667

diff = side - solval;

693 SCIPdebugMsg

(subscip,

"Correcting solution failed\n"

);

696 SCIPdebugMsg

(subscip,

"Correcting solution successful\n"

);

734

assert(heur !=

);

735

assert(sol !=

);

736

assert(vars !=

);

737

assert(linkvars !=

);

762 for

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

803 for

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

807 if

( subvar !=

)

817 SCIPdebugMsg

(

"start solution for reoptimizing is not feasible\n"

);

877 SET

* linkvartoblocks,

878 SET

* blocktolinkvars,

892

shift = maxpenalty / 2.0;

895

offset = range / 2.0 + lowestslack;

896

flatness = maxpenalty / 10.0;

898 for

(

= 0;

< problem->nblocks;

++ )

900 for

( i = 0; i < blocktolinkvars[

; i++ )

903

linkvaridx = blocktolinkvars[

[i];

905 for

( k = 0; k < linkvartoblocks[linkvaridx].

; k++ )

908

b2 = linkvartoblocks[linkvaridx].

[k];

920

assert(binfoout !=

);

924

binfoout->

slackposobjcoeff

= ((oldcoeff - shift) / (flatness +

REALABS

(oldcoeff - shift))) * range / 2.0 + offset;

928

binfoout->

slacknegobjcoeff

= ((oldcoeff - shift) / (flatness +

REALABS

(oldcoeff - shift))) * range / 2.0 + offset;

952

*time =

MAX

(0.0, (timelim - solvingtime));

968

assert(heur !=

);

987

assert(heurdata !=

);

1010 SET

* linkvartoblocks;

1011 SET

* blocktolinkvars;

1017 int

* alllinkvartoblocks;

1042 int

increasedslacks;

1043 int

blockinfolistfill;

1051

assert(heur !=

);

1052

assert(result !=

);

1055

assert(heurdata !=

);

1060

assigneddecomp =

;

1061

sortedconss =

;

1065

alllinkvartoblocks =

;

1067

linkvartoblocks =

;

1068

blocktolinkvars =

;

1069

tmpcouplingvars =

;

1070

tmpcouplingcoef =

;

1072

blockinfolist =

;

1075

nodesleft = heurdata->maxnodes;

1076

gap = heurdata->gap;

1091#ifdef PADM_WRITE_PROBLEMS 1097 if

( heurdata->original )

1102 SCIPwarningMessage

(

"Heuristic %s does not support multiaggregation when the original problem is used.\nPlease turn multiaggregation off to use this feature.\n"

HEUR_NAME

);

1111

decomp = alldecomps[0];

1113

assert(decomp !=

);

1128

decomp = alldecomps[0];

1130

assert(decomp !=

);

1141 if

( nconss == 0 || nvars == 0 || nblocks <= 1 )

1143 SCIPdebugMsg

(

"problem has no constraints, no variables or less than two blocks\n"

);

1152 SCIPdebugMsg

(

"The estimated memory usage for %d blocks is too large.\n"

, nblocks);

1189

decomp = assigneddecomp;

1220 if

( numlinkvars == 0 )

1236 SCIPdebugMsg

(

"Some subscips could not be created successfully.\n"

);

1244 for

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

1245

linkvartoblocks[i].indexes =

;

1246 for

( i = 0; i < problem->nblocks; i++ )

1247

blocktolinkvars[i].indexes =

;

1254 for

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

1258

linkvars[

] = vars[i];

1259

linkvartoblocks[

= &alllinkvartoblocks[

* problem->nblocks];

1260

linkvartoblocks[

= 0;

1266 for

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

1271

assert(linkvartoblocks[i].indexes !=

);

1275 for

(

= 0;

< problem->nblocks;

++ )

1277

var =

SCIPfindVar

((problem->blocks[

]).subscip, vname);

1280

linkvartoblocks[i].

[k] =

;

1281

linkvartoblocks[i].

= k + 1;

1289 if

( timeleft <= 0 )

1297 for

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

1298

varonlyobj[i] =

;

1301 for

(

= 0;

< problem->nblocks;

++ )

1304

blocktolinkvars[

= 0;

1307 for

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

1313

var =

SCIPfindVar

((problem->blocks[

]).subscip, vname);

1316

varonlyobj[i] =

;

1317

blocktolinkvars[

[k] = i;

1318

blocktolinkvars[

= k + 1;

1325 for

(

= 0;

< problem->nblocks;

++ )

1334

tmpcouplingcoef[0] = 1.0;

1335

tmpcouplingcoef[1] = 1.0;

1336

tmpcouplingcoef[2] = -1.0;

1340 for

(

= 0;

< problem->nblocks;

++ )

1342 for

( i = 0; i < blocktolinkvars[

; i++ )

1344 int

linkvaridx = blocktolinkvars[

[i];

1345 for

( k = 0; k < linkvartoblocks[linkvaridx].

; k++ )

1347 if

( linkvartoblocks[linkvaridx].indexes[k] !=

)

1355

blockinfolistfill = 0;

1359 for

(

= 0;

< problem->nblocks;

++ )

1364

blockvars =

SCIPgetVars

((problem->blocks[

]).subscip);

1368 for

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

1374 for

( i = 0; i < blocktolinkvars[

; i++ )

1377

linkvaridx = blocktolinkvars[

[i];

1379 for

( k = 0; k < linkvartoblocks[linkvaridx].

; k++ )

1382

b2 = linkvartoblocks[linkvaridx].

[k];

1388

binfo = &blockinfolist[blockinfolistfill];

1389

blockinfolistfill++;

1394

j = (problem->blocks[

]).ncoupling;

1398

(problem->blocks[

]).slackspos[j] =

;

1400

&((problem->blocks[

]).slackspos[j]), name,

1403

assert((problem->blocks[

]).slackspos[j] !=

);

1405

binfo->

slackposvar

= (problem->blocks[

]).slackspos[j];

1409

(problem->blocks[

]).slacksneg[j] =

;

1411

&((problem->blocks[

]).slacksneg[j]), name,

1414

assert((problem->blocks[

]).slacksneg[j] !=

);

1416

binfo->

slacknegvar

= (problem->blocks[

]).slacksneg[j];

1419

tmpcouplingvars[0] = binfo->

linkvar

;

1426

(problem->blocks[

]).couplingcons[j] =

;

1435

initval =

MAX

(lb, 0.0);

1438

name,

COUPLINGSIZE

, tmpcouplingvars, tmpcouplingcoef, initval, initval) );

1454

name,

COUPLINGSIZE

, tmpcouplingvars, tmpcouplingcoef, initval, initval) );

1461

assert((problem->blocks[

]).couplingcons[j] !=

);

1462

binfo->

couplingCons

= (problem->blocks[

]).couplingcons[j];

1464

(problem->blocks[

]).ncoupling++;

1474#ifdef PADM_WRITE_PROBLEMS 1476 for

(

= 0;

< problem->nblocks;

++ )

1485 for

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

1490 if

( obj > slackthreshold )

1491

slackthreshold = obj;

1498 if

( timeleft <= 0 )

1508

increasedslacks = 0;

1514 while

( !solved && piter < heurdata->penaltyiterations && istimeleft )

1517

solutionsdiffer =

;

1521 while

( solutionsdiffer && aiter < heurdata->admiterations && istimeleft )

1524

solutionsdiffer =

;

1525 SCIPdebugMsg

(

"%d\t%d\t%d\t%s\n"

, piter, aiter, increasedslacks, info);

1528 for

(

= 0;

< problem->nblocks;

++ )

1530 for

( i = 0; i < blocktolinkvars[

; i++ )

1533

linkvaridx = blocktolinkvars[

[i];

1535 for

( k = 0; k < linkvartoblocks[linkvaridx].

; k++ )

1538

b2 = linkvartoblocks[linkvaridx].

[k];

1555

assert(binfoout !=

);

1563

assert(binfo2out !=

);

1583#ifdef PADM_WRITE_PROBLEMS 1584 SCIPdebugMsg

(

"write subscip of block %d in piter=%d and aiter=%d\n"

, piter, aiter);

1598 if

( nodesleft < heurdata->minnodes )

1607

iteration = ((piter - 1) * heurdata->admiterations) + aiter;

1634 SCIPdebugMsg

(

"Block is optimal or reached gaplimit or nodelimit.\n"

);

1638 SCIPdebugMsg

(

"Block reached time limit with at least one feasible solution.\n"

);

1639

istimeleft =

;

1642 for

( i = 0; i < blocktolinkvars[

; i++ )

1645

linkvaridx = blocktolinkvars[

[i];

1647 for

( k = 0; k < linkvartoblocks[linkvaridx].

; k++ )

1650

b2 = linkvartoblocks[linkvaridx].

[k];

1664

assert(binfoout !=

);

1667

assert(sol !=

);

1672

solutionsdiffer =

;

1682 for

( i = 0; i < blocktolinkvars[

; i++ )

1685

linkvaridx = blocktolinkvars[

[i];

1687 for

( k = 0; k < linkvartoblocks[linkvaridx].

; k++ )

1690

b2 = linkvartoblocks[linkvaridx].

[k];

1701

assert(binfoout !=

);

1714 SCIPdebugMsg

(

"Block reached time limit. No optimal solution available.\n"

);

1736

increasedslacks = 0;

1738 for

(

= 0;

< problem->nblocks;

++ )

1740 for

( i = 0; i < blocktolinkvars[

; i++ )

1743

linkvaridx = blocktolinkvars[

[i];

1745 for

( k = 0; k < linkvartoblocks[linkvaridx].

; k++ )

1748

b2 = linkvartoblocks[linkvaridx].

[k];

1762

assert(binfoout !=

);

1803 if

( doscaling && heurdata->scaling )

1808

increasedslacks = 0;

1815 if

( (aiter == 1 && solutionsdiffer ==

) || (doscaling && heurdata->scaling) )

1820 if

( newgap >= mingap )

1822 if

( doscaling && heurdata->scaling )

1833 for

(

= 0;

< problem->nblocks;

++ )

1845

assert(increasedslacks == 0);

1850 for

(

= 0;

< problem->nblocks;

++ )

1858

assert(blocksol !=

);

1859

blockvars = (problem->blocks[

]).subvars;

1860

nblockvars = (problem->blocks[

]).nsubvars;

1863 for

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

1869

solval = blocksolvals[i];

1875 for

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

1877 if

( varonlyobj[i] )

1899 if

( heurdata->reoptimize )

1903

assert(improvedsol !=

|| success ==

);

1949 if

( problem !=

)

1951 for

(

= 0;

< problem->nblocks;

++ )

1953 BLOCK

curr_block = problem->blocks[

];

1954 for

( i = 0; i < (problem->blocks[

]).ncoupling; i++ )

1963 if

( htable !=

)

1966 if

( blockinfolist !=

)

1969 if

( tmpcouplingcoef !=

)

1972 if

( tmpcouplingvars !=

)

1975 if

( problem !=

)

1977 for

(

= problem->nblocks - 1;

>= 0;

-- )

1979 if

( problem->blocks[

].couplingcons !=

)

1988 if

( varonlyobj !=

)

1991 if

( problem !=

&& blocktolinkvars !=

)

1993 for

(

= problem->nblocks -1;

>= 0;

-- )

1995 if

( blocktolinkvars[

].indexes !=

)

2000 if

( linkvars !=

)

2003 if

( alllinkvartoblocks !=

)

2006 if

( blocktolinkvars !=

)

2009 if

( linkvartoblocks !=

)

2012 if

( assigneddecomp !=

)

2015 if

( consssize !=

)

2018 if

( conslabels !=

)

2021 if

( varlabels !=

)

2024 if

( sortedconss !=

)

2027 if

( problem !=

)

2060

assert(heur !=

);

2068 "maximum number of nodes to regard in all subproblems"

2072 "minimum number of nodes to regard in one subproblem"

2079 "maximal number of ADM iterations in each penalty loop"

, &heurdata->admiterations,

DEFAULT_ADMIT

, 1, 100,

) );

2088 "should the problem get reoptimized with the original objective function?"

, &heurdata->reoptimize,

) );

2091 "enable sigmoid rescaling of penalty parameters"

, &heurdata->scaling,

) );

2094 "should linking constraints be assigned?"

, &heurdata->assignlinking,

) );

2097 "should the original problem be used? This is only for testing and not recommended!"

, &heurdata->original,