52 #define MAXREPROPMARK 511 79 assert(num <= tree->childrensize);
105 assert(num <= tree->pathsize);
118 assert(tree !=
NULL);
129 assert(num <= tree->pendingbdchgssize);
144 assert(elem1 !=
NULL);
145 assert(elem2 !=
NULL);
162 assert(fork !=
NULL);
178 assert(fork !=
NULL);
180 assert(blkmem !=
NULL);
201 assert(subroot !=
NULL);
206 SCIPdebugMessage(
"captured LPI state of subroot %p %d times -> new nlpistateref=%d\n",
218 assert(subroot !=
NULL);
220 assert(blkmem !=
NULL);
240 assert(node !=
NULL);
242 SCIPdebugMessage(
"capture %d times LPI state of node #%" SCIP_LONGINT_FORMAT
" at depth %d (current: %d)\n",
255 SCIPerrorMessage(
"node for capturing the LPI state is neither fork nor subroot\n");
269 assert(node !=
NULL);
271 SCIPdebugMessage(
"release LPI state of node #%" SCIP_LONGINT_FORMAT
" at depth %d (current: %d)\n",
281 SCIPerrorMessage(
"node for releasing the LPI state is neither fork nor subroot\n");
294 assert(probingnode !=
NULL);
298 (*probingnode)->lpistate =
NULL;
301 (*probingnode)->ncols = (*probingnode)->ninitialcols;
302 (*probingnode)->nrows = (*probingnode)->ninitialrows;
303 (*probingnode)->origobjvars =
NULL;
304 (*probingnode)->origobjvals =
NULL;
305 (*probingnode)->nchgdobjs = 0;
307 SCIPdebugMessage(
"created probingnode information (%d cols, %d rows)\n", (*probingnode)->ncols, (*probingnode)->nrows);
321 assert(probingnode !=
NULL);
357 assert(probingnode !=
NULL);
358 assert(*probingnode !=
NULL);
361 if( (*probingnode)->lpistate !=
NULL )
367 if( (*probingnode)->nchgdobjs > 0 )
369 assert((*probingnode)->origobjvars !=
NULL);
370 assert((*probingnode)->origobjvals !=
NULL);
388 assert(junction !=
NULL);
389 assert(tree !=
NULL);
414 assert(pseudofork !=
NULL);
415 assert(blkmem !=
NULL);
416 assert(tree !=
NULL);
423 (*pseudofork)->addedcols =
NULL;
424 (*pseudofork)->addedrows =
NULL;
427 (*pseudofork)->nchildren = tree->
nchildren;
429 SCIPdebugMessage(
"creating pseudofork information with %d children (%d new cols, %d new rows)\n",
430 (*pseudofork)->nchildren, (*pseudofork)->naddedcols, (*pseudofork)->naddedrows);
432 if( (*pseudofork)->naddedcols > 0 )
436 (*pseudofork)->naddedcols) );
438 if( (*pseudofork)->naddedrows > 0 )
444 (*pseudofork)->naddedrows) );
447 for( i = 0; i < (*pseudofork)->naddedrows; ++i )
471 assert(pseudofork !=
NULL);
472 assert(*pseudofork !=
NULL);
473 assert((*pseudofork)->nchildren == 0);
474 assert(blkmem !=
NULL);
478 for( i = 0; i < (*pseudofork)->naddedrows; ++i )
501 assert(fork !=
NULL);
502 assert(blkmem !=
NULL);
503 assert(tree !=
NULL);
519 (*fork)->nlpistateref = 0;
520 (*fork)->addedcols =
NULL;
521 (*fork)->addedrows =
NULL;
524 (*fork)->nchildren = (
unsigned int) tree->
nchildren;
526 SCIPsetDebugMsg(
set,
"creating fork information with %u children (%d new cols, %d new rows)\n", (*fork)->nchildren, (*fork)->naddedcols, (*fork)->naddedrows);
528 if( (*fork)->naddedcols > 0 )
533 if( (*fork)->naddedrows > 0 )
541 for( i = 0; i < (*fork)->naddedrows; ++i )
562 assert(fork !=
NULL);
563 assert(*fork !=
NULL);
564 assert((*fork)->nchildren == 0);
565 assert((*fork)->nlpistateref == 0);
566 assert((*fork)->lpistate ==
NULL);
567 assert(blkmem !=
NULL);
572 for( i = (*fork)->naddedrows - 1; i >= 0; --i )
598 assert(subroot !=
NULL);
599 assert(blkmem !=
NULL);
600 assert(tree !=
NULL);
611 (*subroot)->nlpistateref = 0;
614 (*subroot)->nchildren = (
unsigned int) tree->
nchildren;
619 if( (*subroot)->ncols != 0 )
624 (*subroot)->cols =
NULL;
625 if( (*subroot)->nrows != 0 )
630 (*subroot)->rows =
NULL;
633 for( i = 0; i < (*subroot)->nrows; ++i )
654 assert(subroot !=
NULL);
655 assert(*subroot !=
NULL);
656 assert((*subroot)->nchildren == 0);
657 assert((*subroot)->nlpistateref == 0);
658 assert((*subroot)->lpistate ==
NULL);
659 assert(blkmem !=
NULL);
664 for( i = 0; i < (*subroot)->nrows; ++i )
685 assert(tree !=
NULL);
686 assert(sibling !=
NULL);
711 assert(tree !=
NULL);
712 assert(child !=
NULL);
734 assert(tree !=
NULL);
735 assert(child !=
NULL);
764 assert(node !=
NULL);
770 assert(blkmem !=
NULL);
772 assert(tree !=
NULL);
795 SCIPsetDebugMsg(
set,
"assigning parent #%" SCIP_LONGINT_FORMAT
" to node #%" SCIP_LONGINT_FORMAT
" at depth %d\n",
822 assert(node !=
NULL);
823 assert(blkmem !=
NULL);
824 assert(tree !=
NULL);
826 SCIPsetDebugMsg(
set,
"releasing parent-child relationship of node #%" SCIP_LONGINT_FORMAT
" at depth %d of type %d with parent #%" SCIP_LONGINT_FORMAT
" of type %d\n",
905 if( freeParent && !parent->
active )
917 SCIPsetDebugMsg(
set,
"unlinked node #%" SCIP_LONGINT_FORMAT
" in depth %d -> new effective root depth: %d\n",
933 assert(node !=
NULL);
936 (*node)->parent =
NULL;
937 (*node)->conssetchg =
NULL;
938 (*node)->domchg =
NULL;
942 (*node)->reoptid = 0;
945 (*node)->active =
FALSE;
946 (*node)->cutoff =
FALSE;
947 (*node)->reprop =
FALSE;
948 (*node)->repropsubtreemark = 0;
964 assert(node !=
NULL);
965 assert(blkmem !=
NULL);
967 assert(stat !=
NULL);
968 assert(tree !=
NULL);
984 (*node)->data.child.arraypos = -1;
1013 assert(node !=
NULL);
1014 assert(*node !=
NULL);
1015 assert(!(*node)->active);
1016 assert(blkmem !=
NULL);
1017 assert(tree !=
NULL);
1033 SCIPerrorMessage(
"cannot free focus node - has to be converted into a dead end first\n");
1042 assert((*node)->data.sibling.arraypos >= 0);
1043 assert((*node)->data.sibling.arraypos < tree->
nsiblings);
1044 assert(tree->
siblings[(*node)->data.sibling.arraypos] == *node);
1054 assert((*node)->data.child.arraypos >= 0);
1055 assert((*node)->data.child.arraypos < tree->
nchildren);
1056 assert(tree->
children[(*node)->data.child.arraypos] == *node);
1065 if( (*node)->data.leaf.lpstatefork !=
NULL )
1134 assert(node !=
NULL);
1135 assert(
set !=
NULL);
1136 assert(stat !=
NULL);
1137 assert(tree !=
NULL);
1139 if( set->reopt_enable )
1141 assert(reopt !=
NULL);
1155 if( node->
depth == 0 )
1158 if( set->misc_calcintegral )
1173 SCIPsetDebugMsg(
set,
"cutting off %s node #%" SCIP_LONGINT_FORMAT
" at depth %d (cutoffdepth: %d)\n",
1187 assert(node !=
NULL);
1188 assert(
set !=
NULL);
1189 assert(stat !=
NULL);
1190 assert(tree !=
NULL);
1200 SCIPsetDebugMsg(
set,
"marked %s node #%" SCIP_LONGINT_FORMAT
" at depth %d to be propagated again (repropdepth: %d)\n",
1211 assert(node !=
NULL);
1212 assert(tree !=
NULL);
1240 assert(tree !=
NULL);
1280 assert(node !=
NULL);
1288 assert(stat !=
NULL);
1289 assert(tree !=
NULL);
1291 assert(cutoff !=
NULL);
1294 initialreprop = node->
reprop;
1303 if( clockisrunning )
1328 SCIP_CALL(
SCIPpropagateDomains(blkmem,
set, stat, transprob, origprob, primal, tree, reopt, lp, branchcand,
1330 assert(!node->
reprop || *cutoff);
1347 SCIPsetDebugMsg(
set,
"repropagation %" SCIP_LONGINT_FORMAT
" at depth %u changed %" SCIP_LONGINT_FORMAT
" bounds (total reprop bound changes: %" SCIP_LONGINT_FORMAT
"), cutoff: %u\n",
1355 if( initialreprop && !(*cutoff) && stat->
nboundchgs > oldnboundchgs )
1359 SCIPsetDebugMsg(
set,
"initial repropagation at depth %u changed %" SCIP_LONGINT_FORMAT
" bounds -> repropagating subtree (new mark: %d)\n",
1382 if( clockisrunning )
1418 assert(node !=
NULL);
1420 assert(stat !=
NULL);
1421 assert(tree !=
NULL);
1423 assert(cutoff !=
NULL);
1425 SCIPsetDebugMsg(
set,
"activate node #%" SCIP_LONGINT_FORMAT
" at depth %d of type %d (reprop subtree mark: %u)\n",
1444 node->
reprop =
set->conf_enable &&
set->conf_useprop;
1458 SCIP_CALL(
nodeRepropagate(node, blkmem,
set, stat, transprob, origprob, primal, tree, reopt, lp, branchcand, conflict,
1459 eventfilter, eventqueue, cliquetable, &propcutoff) );
1460 *cutoff = *cutoff || propcutoff;
1481 assert(node !=
NULL);
1483 assert(tree !=
NULL);
1486 SCIPsetDebugMsg(
set,
"deactivate node #%" SCIP_LONGINT_FORMAT
" at depth %d of type %d (reprop subtree mark: %u)\n",
1548 assert(node !=
NULL);
1549 assert(cons !=
NULL);
1551 assert(tree !=
NULL);
1558 if( cons->
scip != set->scip )
1587 assert(node !=
NULL);
1588 assert(tree !=
NULL);
1589 assert(cons !=
NULL);
1617 assert(node !=
NULL );
1625 if( addedconsssize < *naddedconss )
1629 for( cons = 0; cons < *naddedconss; cons++ )
1642 assert(node !=
NULL);
1665 assert(tree !=
NULL);
1685 if( node->
depth == 0 )
1767 assert(node !=
NULL);
1772 || node->
depth == 0);
1773 assert(
set !=
NULL);
1774 assert(tree !=
NULL);
1777 assert(var !=
NULL);
1778 assert(node->
active || (infercons ==
NULL && inferprop ==
NULL));
1781 SCIPsetDebugMsg(
set,
"adding boundchange at node %llu at depth %u to variable <%s>: old bounds=[%g,%g], new %s bound: %g (infer%s=<%s>, inferinfo=%d)\n",
1788 inferboundtype = boundtype;
1819 newbound =
MIN(newbound, oldub);
1837 newbound =
MAX(newbound, oldlb);
1847 SCIPsetDebugMsg(
set,
" -> transformed to active variable <%s>: old bounds=[%g,%g], new %s bound: %g, obj: %g\n",
1859 int conflictingdepth;
1863 if( conflictingdepth >= 0 )
1866 assert(conflictingdepth > 0);
1867 assert(conflictingdepth < tree->pathlen);
1869 SCIPsetDebugMsg(
set,
" -> bound change <%s> %s %g violates current local bounds [%g,%g] since depth %d: remember for later application\n",
1895 assert(!probingchange);
1897 SCIPsetDebugMsg(
set,
" -> bound change in root node: perform global bound change\n");
1904 SCIPsetDebugMsg(
set,
"marked root node to be repropagated due to global bound change <%s>:[%g,%g] -> [%g,%g] found in depth %u\n",
1943 if( set->misc_exactsolve )
1957 0.0, infervar, infercons, inferprop, inferinfo, inferboundtype) );
2010 SCIP_CALL(
SCIPnodeAddBoundinfer(node, blkmem,
set, stat, transprob, origprob, tree, reopt, lp, branchcand, eventqueue,
2011 cliquetable, var, newbound, boundtype,
NULL,
NULL, 0, probingchange) );
2041 assert(node !=
NULL);
2046 || node->
depth == 0);
2047 assert(blkmem !=
NULL);
2048 assert(
set !=
NULL);
2049 assert(tree !=
NULL);
2052 assert(var !=
NULL);
2053 assert(node->
active || (infercons ==
NULL && inferprop ==
NULL));
2064 adjustedleft = left;
2065 adjustedright = right;
2079 SCIPsetDebugMsg(
set,
"adding hole (%g,%g) at node at depth %u to variable <%s>: bounds=[%g,%g], (infer%s=<%s>, inferinfo=%d)\n",
2110 assert(!probingchange);
2112 SCIPsetDebugMsg(
set,
" -> hole added in root node: perform global domain change\n");
2119 SCIPsetDebugMsg(
set,
"marked root node to be repropagated due to global added hole <%s>: (%g,%g) found in depth %u\n",
2129 SCIPerrorMessage(
"WARNING: currently domain holes can only be handled globally!\n");
2155 assert(node !=
NULL);
2159 assert(blkmem !=
NULL);
2161 SCIPsetDebugMsg(
set,
"adding hole (%g,%g) at node at depth %u of variable <%s>\n",
2165 NULL,
NULL, 0, probingchange, added) );
2193 assert(tree !=
NULL);
2196 for( i = 0; i < npendingbdchgs; ++i )
2208 if( conflictdepth == 0 )
2218 assert(conflictdepth == -1);
2279 assert(node !=
NULL);
2280 assert(stat !=
NULL);
2289 if( node->
depth == 0 )
2292 if( set->misc_calcintegral )
2299 assert(newbound >= lowerbound);
2321 assert(
set !=
NULL);
2329 if( set->misc_exactsolve )
2367 assert(node !=
NULL);
2368 assert(
set !=
NULL);
2394 assert(node !=
NULL);
2399 assert(cutoff !=
NULL);
2401 SCIPsetDebugMsg(
set,
"implication graph propagation of node #%" SCIP_LONGINT_FORMAT
" in depth %d\n",
2408 for( i = 0; i < nboundchgs && !(*cutoff); ++i )
2438 for( j = 0; j < nimpls; ++j )
2482 SCIP_CALL(
SCIPnodeAddBoundinfer(node, blkmem,
set, stat, transprob, origprob, tree, reopt, lp, branchcand,
2483 eventqueue, cliquetable, implvars[j], implbounds[j], impltypes[j],
NULL,
NULL, 0,
FALSE) );
2489 for( j = 0; j < ncliques; ++j )
2499 for( k = 0; k < nvars; ++k )
2509 if( vars[k] == var && values[k] == varfixing )
2515 if( values[k] ==
FALSE )
2540 SCIP_CALL(
SCIPnodeAddBoundinfer(node, blkmem,
set, stat, transprob, origprob, tree, reopt, lp, branchcand,
2570 assert(tree !=
NULL);
2571 assert(startdepth >= 0);
2572 assert(startdepth <= tree->pathlen);
2574 if( startdepth == 0 )
2585 for( i = startdepth; i < tree->
pathlen; ++i )
2587 node = tree->
path[i];
2588 assert(node !=
NULL);
2590 assert((
int)(node->
depth) == i);
2604 if( i < tree->pathlen-1 )
2684 assert(tree !=
NULL);
2699 assert(commonfork !=
NULL);
2700 assert(newlpfork !=
NULL);
2701 assert(newlpstatefork !=
NULL);
2702 assert(newsubroot !=
NULL);
2703 assert(cutoff !=
NULL);
2707 *newlpstatefork =
NULL;
2743 if( lpfork ==
NULL )
2751 *newlpfork = lpfork;
2753 lpstatefork = lpfork;
2756 lpstatefork = lpstatefork->
parent;
2757 if( lpstatefork ==
NULL )
2759 if( lpstatefork->
cutoff )
2765 *newlpstatefork = lpstatefork;
2767 subroot = lpstatefork;
2770 subroot = subroot->
parent;
2771 if( subroot ==
NULL )
2779 *newsubroot = subroot;
2799 assert(fork !=
NULL);
2804 assert(fork !=
NULL);
2815 if( lpstatefork ==
NULL 2821 assert(lpfork ==
NULL || !lpfork->
active || lpfork == fork);
2822 assert(lpstatefork ==
NULL || !lpstatefork->
active || lpstatefork == fork);
2823 assert(subroot ==
NULL || !subroot->
active || subroot == fork);
2836 assert(fork !=
NULL);
2846 if( lpfork ==
NULL )
2852 while( lpfork !=
NULL 2869 assert(lpfork ==
NULL 2878 if( lpstatefork ==
NULL )
2884 lpstatefork = lpfork;
2887 while( lpstatefork !=
NULL 2891 assert(lpstatefork->
active);
2892 lpstatefork = lpstatefork->
parent;
2900 assert(lpstatefork ==
NULL || (
int)(lpstatefork->
depth) <= fork->
depth);
2901 assert(lpstatefork ==
NULL || lpstatefork->
active);
2903 assert(lpstatefork ==
NULL 2906 assert(lpstatefork ==
NULL || (lpfork !=
NULL && lpstatefork->
depth <= lpfork->
depth));
2912 if( subroot ==
NULL )
2918 subroot = lpstatefork;
2926 subroot = subroot->
parent;
2935 assert(subroot ==
NULL || (lpstatefork !=
NULL && subroot->
depth <= lpstatefork->
depth));
2950 *newlpfork = lpfork;
2951 *newlpstatefork = lpstatefork;
2952 *newsubroot = subroot;
2955 while( fork !=
NULL )
2992 assert(tree !=
NULL);
2994 assert(fork ==
NULL || focusnode !=
NULL);
2997 assert(cutoff !=
NULL);
3004 focusnodedepth = (focusnode !=
NULL ? (int)focusnode->
depth : -1);
3005 forkdepth = (fork !=
NULL ? (int)fork->
depth : -1);
3006 assert(forkdepth <= focusnodedepth);
3007 assert(forkdepth < tree->pathlen);
3013 for( i = tree->
pathlen-1; i > forkdepth; --i )
3020 SCIP_CALL(
treeApplyPendingBdchgs(tree, reopt, blkmem,
set, stat, transprob, origprob, lp, branchcand, eventqueue, cliquetable) );
3024 while( focusnode != fork )
3026 assert(focusnode !=
NULL);
3027 assert(!focusnode->
active);
3028 assert(!focusnode->
cutoff);
3029 tree->
path[focusnode->
depth] = focusnode;
3030 focusnode = focusnode->
parent;
3039 assert(tree->
path[forkdepth] == fork);
3043 SCIP_CALL(
nodeRepropagate(fork, blkmem,
set, stat, transprob, origprob, primal, tree, reopt, lp, branchcand, conflict,
3044 eventfilter, eventqueue, cliquetable, cutoff) );
3046 assert(fork !=
NULL || !(*cutoff));
3059 for( i = forkdepth+1; i < focusnodedepth && !(*cutoff); ++i )
3066 SCIP_CALL(
nodeActivate(tree->
path[i], blkmem,
set, stat, transprob, origprob, primal, tree, reopt, lp, branchcand,
3067 conflict, eventfilter, eventqueue, cliquetable, cutoff) );
3074 if( !(*cutoff) && (i == focusnodedepth) )
3077 assert(tree->
pathlen == focusnodedepth);
3081 SCIP_CALL(
nodeActivate(tree->
path[focusnodedepth], blkmem,
set, stat, transprob, origprob, primal, tree, reopt, lp, branchcand,
3082 conflict, eventfilter, eventqueue, cliquetable, cutoff) );
3119 assert(subroot !=
NULL);
3122 assert(blkmem !=
NULL);
3123 assert(
set !=
NULL);
3131 assert(ncols == 0 || cols !=
NULL);
3132 assert(nrows == 0 || rows !=
NULL);
3134 for( c = 0; c < ncols; ++c )
3138 for( r = 0; r < nrows; ++r )
3164 assert(fork !=
NULL);
3167 assert(blkmem !=
NULL);
3168 assert(
set !=
NULL);
3176 assert(ncols == 0 || cols !=
NULL);
3177 assert(nrows == 0 || rows !=
NULL);
3179 for( c = 0; c < ncols; ++c )
3183 for( r = 0; r < nrows; ++r )
3209 assert(pseudofork !=
NULL);
3212 assert(blkmem !=
NULL);
3213 assert(
set !=
NULL);
3221 assert(ncols == 0 || cols !=
NULL);
3222 assert(nrows == 0 || rows !=
NULL);
3224 for( c = 0; c < ncols; ++c )
3228 for( r = 0; r < nrows; ++r )
3248 assert(tree !=
NULL);
3253 for( d = 0; d < tree->
pathlen; ++d )
3255 node = tree->
path[d];
3256 assert(node !=
NULL);
3257 assert((
int)(node->
depth) == d);
3267 if( d < tree->pathlen-1 )
3298 SCIPerrorMessage(
"node at depth %d on active path has to be of type JUNCTION, PSEUDOFORK, FORK, SUBROOT, FOCUSNODE, REFOCUSNODE, or PROBINGNODE, but is %d\n",
3307 #define treeCheckPath(tree) 3325 assert(tree !=
NULL);
3334 assert(blkmem !=
NULL);
3335 assert(
set !=
NULL);
3337 assert(initroot !=
NULL);
3339 SCIPsetDebugMsg(
set,
"load LP for current fork node #%" SCIP_LONGINT_FORMAT
" at depth %d\n",
3353 if( lpfork ==
NULL )
3366 assert(tree->
path[lpfork->
depth] == lpfork);
3367 lpforkdepth = lpfork->
depth;
3369 assert(lpforkdepth < tree->pathlen-1);
3393 assert(lpforkdepth < tree->pathlen);
3400 pathnode = tree->
path[d];
3401 assert(pathnode !=
NULL);
3402 assert((
int)(pathnode->
depth) == d);
3451 int lpstateforkdepth;
3454 assert(tree !=
NULL);
3464 assert(blkmem !=
NULL);
3465 assert(
set !=
NULL);
3468 SCIPsetDebugMsg(
set,
"load LP state for current fork node #%" SCIP_LONGINT_FORMAT
" at depth %d\n",
3475 if( lpstatefork ==
NULL )
3480 assert(lpstatefork->
active);
3481 assert(tree->
path[lpstatefork->
depth] == lpstatefork);
3482 lpstateforkdepth = lpstatefork->
depth;
3483 assert(lpstateforkdepth < tree->pathlen-1);
3484 assert(lpstateforkdepth <= tree->correctlpdepth);
3512 checkbdchgs =
FALSE;
3528 assert(d < tree->pathlen);
3566 assert(stat !=
NULL);
3567 assert(lpstatefork ==
NULL || lpstatefork->
depth < (*node)->depth);
3568 assert(lpstatefork ==
NULL || lpstatefork->
active ||
SCIPsetIsGE(
set, (*node)->lowerbound, cutoffbound));
3569 assert(lpstatefork ==
NULL 3574 SCIPsetDebugMsg(
set,
"convert node #%" SCIP_LONGINT_FORMAT
" at depth %d to leaf with lpstatefork #%" SCIP_LONGINT_FORMAT
" at depth %d\n",
3579 (*node)->data.leaf.lpstatefork = lpstatefork;
3586 pathnode = (*node)->
parent;
3587 while( pathnode !=
NULL && pathnode != lpstatefork )
3591 pathnode = pathnode->
parent;
3593 assert(pathnode == lpstatefork);
3598 if(
SCIPsetIsLT(
set, (*node)->lowerbound, cutoffbound) )
3611 if( set->reopt_enable )
3613 assert(reopt !=
NULL);
3623 assert(*node ==
NULL);
3653 assert(blkmem !=
NULL);
3654 assert(
set !=
NULL);
3655 assert(stat !=
NULL);
3656 assert(tree !=
NULL);
3663 needdel = (tree->
focusnode == tree->
root ?
set->price_delvarsroot :
set->price_delvars);
3680 for( i = 0; i < transprob->
nvars; i++ )
3682 var = transprob->
vars[i];
3683 assert(var !=
NULL);
3720 SCIPsetDebugMsg(
set,
"delvars at node %" SCIP_LONGINT_FORMAT
", deleted %d vars\n", stat->
nnodes, ndelvars);
3747 assert(blkmem !=
NULL);
3748 assert(tree !=
NULL);
3754 SCIPsetDebugMsg(
set,
"focusnode #%" SCIP_LONGINT_FORMAT
" to dead-end at depth %d\n",
3758 SCIP_CALL(
focusnodeCleanupVars(blkmem,
set, stat, eventqueue, transprob, origprob, tree, reopt, lp, branchcand, cliquetable,
TRUE) );
3786 assert(tree !=
NULL);
3792 SCIPsetDebugMsg(
set,
"focusnode #%" SCIP_LONGINT_FORMAT
" to leaf at depth %d\n",
3810 assert(tree !=
NULL);
3817 SCIPsetDebugMsg(
set,
"focusnode #%" SCIP_LONGINT_FORMAT
" to junction at depth %d\n",
3855 assert(blkmem !=
NULL);
3856 assert(tree !=
NULL);
3864 SCIPsetDebugMsg(
set,
"focusnode #%" SCIP_LONGINT_FORMAT
" to pseudofork at depth %d\n",
3868 SCIP_CALL(
focusnodeCleanupVars(blkmem,
set, stat, eventqueue, transprob, origprob, tree, reopt, lp, branchcand, cliquetable,
FALSE) );
3909 assert(blkmem !=
NULL);
3910 assert(tree !=
NULL);
3920 SCIPsetDebugMsg(
set,
"focusnode #%" SCIP_LONGINT_FORMAT
" to fork at depth %d\n",
3936 SCIP_CALL(
SCIPlpSolveAndEval(lp,
set, messagehdlr, blkmem, stat, eventqueue, eventfilter, transprob, -1LL,
FALSE,
FALSE,
TRUE, &lperror) );
3957 "(node %" SCIP_LONGINT_FORMAT
") numerical troubles: LP %" SCIP_LONGINT_FORMAT
" not optimal -- convert node into junction instead of fork\n",
3974 SCIP_CALL(
focusnodeCleanupVars(blkmem,
set, stat, eventqueue, transprob, origprob, tree, reopt, lp, branchcand, cliquetable,
FALSE) );
4024 assert(blkmem !=
NULL);
4025 assert(tree !=
NULL);
4035 SCIPsetDebugMsg(
set,
"focusnode #%" SCIP_LONGINT_FORMAT
" to subroot at depth %d\n",
4045 #ifdef SCIP_DISABLED_CODE 4060 SCIP_CALL(
SCIPlpSolveAndEval(lp,
set, messagehdlr, blkmem, stat, eventqueue, eventfilter, transprob, -1LL,
FALSE,
FALSE,
TRUE, &lperror) );
4064 assert(lp->
solved || lperror);
4081 "(node %" SCIP_LONGINT_FORMAT
") numerical troubles: LP %" SCIP_LONGINT_FORMAT
" not optimal -- convert node into junction instead of subroot\n",
4098 SCIP_CALL(
focusnodeCleanupVars(blkmem,
set, stat, eventqueue, transprob, origprob, tree, lp, branchcand, cliquetable,
FALSE) );
4105 SCIP_CALL( subrootCreate(&subroot, blkmem,
set, transprob, tree, lp) );
4144 assert(tree !=
NULL);
4145 assert(
set !=
NULL);
4146 assert(nnodes !=
NULL);
4147 assert(*nnodes == 0 || nodes !=
NULL);
4149 for( i = 0; i < *
nnodes; ++i )
4152 SCIP_CALL(
nodeToLeaf(&nodes[i], blkmem,
set, stat, eventqueue, tree, reopt, lp, lpstatefork, cutoffbound) );
4153 assert(nodes[i] ==
NULL);
4171 assert(tree !=
NULL);
4231 assert(node !=
NULL);
4232 assert(*node ==
NULL 4236 assert(*node ==
NULL || !(*node)->active);
4237 assert(stat !=
NULL);
4238 assert(tree !=
NULL);
4239 assert(!postponed || *node ==
NULL);
4243 assert(cutoff !=
NULL);
4245 SCIPsetDebugMsg(
set,
"focusing node #%" SCIP_LONGINT_FORMAT
" of type %d in depth %d\n",
4256 SCIPsetDebugMsg(
set,
"focus node: focusnodedepth=%d, forkdepth=%d, lpforkdepth=%d, lpstateforkdepth=%d, subrootdepth=%d, cutoff=%u\n",
4257 *node !=
NULL ? (*node)->depth : -1, fork !=
NULL ? fork->
depth : -1,
4259 subroot !=
NULL ? subroot->
depth : -1, *cutoff);
4264 assert(*node !=
NULL);
4272 if( set->reopt_enable )
4274 assert(reopt !=
NULL);
4287 assert(lpstatefork ==
NULL || lpfork !=
NULL);
4288 assert(subroot ==
NULL || lpstatefork !=
NULL);
4318 SCIP_CALL(
treeNodesToQueue(tree, reopt, blkmem,
set, stat, eventqueue, lp, tree->
children, &tree->
nchildren,
NULL, -
SCIPsetInfinity(
set)) );
4335 SCIP_CALL(
treeNodesToQueue(tree, reopt, blkmem,
set, stat, eventqueue, lp, tree->
children, &tree->
nchildren,
NULL, -
SCIPsetInfinity(
set)) );
4346 SCIP_CALL(
treeNodesToQueue(tree, reopt, blkmem,
set, stat, eventqueue, lp, tree->
siblings, &tree->
nsiblings, tree->
focuslpstatefork,
4360 assert(*node ==
NULL);
4372 SCIP_CALL(
focusnodeToDeadend(blkmem,
set, stat, eventqueue, transprob, origprob, tree, reopt, lp, branchcand,
4387 assert(oldcutoffdepth == INT_MAX);
4400 SCIP_CALL( focusnodeToSubroot(blkmem,
set, messagehdlr, stat, eventqueue, eventfilter, transprob, origprob, tree, lp, branchcand) );
4410 reopt, lp, branchcand, cliquetable) );
4439 branchcand, cliquetable) );
4473 SCIP_CALL(
focusnodeToDeadend(blkmem,
set, stat, eventqueue, transprob, origprob, tree, reopt, lp, branchcand, cliquetable) );
4476 assert(lpstatefork ==
NULL 4479 assert(childrenlpstatefork ==
NULL 4482 assert(lpfork ==
NULL 4493 SCIP_CALL(
treeNodesToQueue(tree, reopt, blkmem,
set, stat, eventqueue, lp, tree->
siblings, &tree->
nsiblings, tree->
focuslpstatefork,
4497 SCIP_CALL(
treeNodesToQueue(tree, reopt, blkmem,
set, stat, eventqueue, lp, tree->
children, &tree->
nchildren, childrenlpstatefork,
4513 SCIP_CALL(
treeNodesToQueue(tree, reopt, blkmem,
set, stat, eventqueue, lp, tree->
children, &tree->
nchildren, childrenlpstatefork,
4531 SCIP_CALL(
treeNodesToQueue(tree, reopt, blkmem,
set, stat, eventqueue, lp, tree->
siblings, &tree->
nsiblings, tree->
focuslpstatefork,
4545 SCIP_CALL(
treeNodesToQueue(tree, reopt, blkmem,
set, stat, eventqueue, lp, tree->
siblings, &tree->
nsiblings, tree->
focuslpstatefork,
4564 SCIP_CALL(
treeNodesToQueue(tree, reopt, blkmem,
set, stat, eventqueue, lp, tree->
children, &tree->
nchildren, childrenlpstatefork,
4587 assert(subroot ==
NULL || (lpstatefork !=
NULL && subroot->
depth <= lpstatefork->
depth));
4588 assert(lpstatefork ==
NULL || (lpfork !=
NULL && lpstatefork->
depth <= lpfork->
depth));
4589 assert(lpfork ==
NULL || (*node !=
NULL && lpfork->
depth < (*node)->depth));
4598 SCIP_CALL(
treeSwitchPath(tree, reopt, blkmem,
set, stat, transprob, origprob, primal, lp, branchcand, conflict,
4599 eventfilter, eventqueue, cliquetable, fork, *node, cutoff) );
4602 assert(*node ==
NULL || tree->
pathlen-1 <= (
int)(*node)->depth);
4607 int appliedeffectiverootdepth;
4610 assert(appliedeffectiverootdepth <= tree->effectiverootdepth);
4620 SCIPsetDebugMsg(
set,
"effective root is now at depth %d: applying constraint set and bound changes to global problem\n",
4627 SCIPsetDebugMsg(
set,
" -> applying constraint set changes of depth %d\n", d);
4665 assert(tree !=
NULL);
4666 assert(blkmem !=
NULL);
4670 (*tree)->root =
NULL;
4675 for( p = 0; p <= 1; ++p )
4680 (*tree)->ndivebdchanges[p] = 0;
4681 (*tree)->divebdchgsize[p] = 1;
4684 (*tree)->path =
NULL;
4685 (*tree)->focusnode =
NULL;
4686 (*tree)->focuslpfork =
NULL;
4687 (*tree)->focuslpstatefork =
NULL;
4688 (*tree)->focussubroot =
NULL;
4689 (*tree)->children =
NULL;
4690 (*tree)->siblings =
NULL;
4691 (*tree)->probingroot =
NULL;
4692 (*tree)->childrenprio =
NULL;
4693 (*tree)->siblingsprio =
NULL;
4694 (*tree)->pathnlpcols =
NULL;
4695 (*tree)->pathnlprows =
NULL;
4696 (*tree)->probinglpistate =
NULL;
4697 (*tree)->probinglpinorms =
NULL;
4698 (*tree)->pendingbdchgs =
NULL;
4699 (*tree)->pendingbdchgssize = 0;
4700 (*tree)->npendingbdchgs = 0;
4701 (*tree)->focuslpstateforklpcount = -1;
4702 (*tree)->childrensize = 0;
4703 (*tree)->nchildren = 0;
4704 (*tree)->siblingssize = 0;
4705 (*tree)->nsiblings = 0;
4706 (*tree)->pathlen = 0;
4707 (*tree)->pathsize = 0;
4708 (*tree)->effectiverootdepth = 0;
4709 (*tree)->appliedeffectiverootdepth = 0;
4710 (*tree)->correctlpdepth = -1;
4711 (*tree)->cutoffdepth = INT_MAX;
4712 (*tree)->repropdepth = INT_MAX;
4713 (*tree)->repropsubtreecount = 0;
4714 (*tree)->focusnodehaslp =
FALSE;
4715 (*tree)->probingnodehaslp =
FALSE;
4716 (*tree)->focuslpconstructed =
FALSE;
4717 (*tree)->cutoffdelayed =
FALSE;
4718 (*tree)->probinglpwasflushed =
FALSE;
4719 (*tree)->probinglpwassolved =
FALSE;
4720 (*tree)->probingloadlpistate =
FALSE;
4721 (*tree)->probinglpwasrelax =
FALSE;
4722 (*tree)->probingsolvedlp =
FALSE;
4723 (*tree)->forcinglpmessage =
FALSE;
4724 (*tree)->sbprobing =
FALSE;
4725 (*tree)->probinglpwasprimfeas =
TRUE;
4726 (*tree)->probinglpwasdualfeas =
TRUE;
4743 assert(tree !=
NULL);
4744 assert(*tree !=
NULL);
4745 assert((*tree)->nchildren == 0);
4746 assert((*tree)->nsiblings == 0);
4747 assert((*tree)->focusnode ==
NULL);
4756 for( p = 0; p <= 1; ++p )
4790 assert(tree !=
NULL);
4808 assert(var !=
NULL);
4849 assert(tree !=
NULL);
4877 SCIP_CALL(
treeNodesToQueue(tree, reopt, blkmem,
set, stat, eventqueue, lp, tree->
children, &tree->
nchildren,
NULL,
4905 assert(tree !=
NULL);
4917 SCIP_CALL(
SCIPnodeFocus(&tree->
root, blkmem,
set, messagehdlr, stat, transprob, origprob, primal, tree, reopt, lp, branchcand,
4918 conflict, conflictstore, eventfilter, eventqueue, cliquetable, &cutoff,
FALSE,
FALSE) );
4947 assert(tree !=
NULL);
4954 SCIP_CALL(
SCIPnodeFocus(&node, blkmem,
set, messagehdlr, stat, transprob, origprob, primal, tree, reopt, lp, branchcand,
4955 conflict, conflictstore, eventfilter, eventqueue, cliquetable, &cutoff,
FALSE,
FALSE) );
4972 assert(tree !=
NULL);
4986 assert(tree !=
NULL);
4987 assert(stat !=
NULL);
5020 assert(tree !=
NULL);
5021 assert(stat !=
NULL);
5040 for( i = tree->
nsiblings-1; i >= 0; --i )
5045 SCIPsetDebugMsg(
set,
"cut off sibling #%" SCIP_LONGINT_FORMAT
" at depth %d with lowerbound=%g at position %d\n",
5048 if( set->reopt_enable )
5050 assert(reopt !=
NULL);
5063 for( i = tree->
nchildren-1; i >= 0; --i )
5068 SCIPsetDebugMsg(
set,
"cut off child #%" SCIP_LONGINT_FORMAT
" at depth %d with lowerbound=%g at position %d\n",
5071 if( set->reopt_enable )
5073 assert(reopt !=
NULL);
5110 assert(
set !=
NULL);
5132 switch( set->nodesel_childsel )
5147 prio = targetvalue - varsol;
5150 prio = varrootsol - varsol;
5154 if( !isroot && haslp )
5155 prio *= (varrootsol - varsol + 1.0);
5158 SCIPerrorMessage(
"invalid child selection rule <%c>\n", set->nodesel_childsel);
5164 SCIPerrorMessage(
"invalid preferred branching direction <%d> of variable <%s>\n",
5181 switch( set->nodesel_childsel )
5196 prio = varsol - targetvalue;
5199 prio = varsol - varrootsol;
5203 if( !isroot && haslp )
5204 prio *= (varsol - varrootsol + 1.0);
5207 SCIPerrorMessage(
"invalid child selection rule <%c>\n", set->nodesel_childsel);
5218 SCIPerrorMessage(
"invalid preferred branching direction <%d> of variable <%s>\n",
5253 assert(tree !=
NULL);
5254 assert(var !=
NULL);
5277 if( estimateinc > 0.0 )
5278 estimate += estimateinc;
5330 assert(tree !=
NULL);
5331 assert(
set !=
NULL);
5332 assert(var !=
NULL);
5335 if( downchild !=
NULL )
5337 if( eqchild !=
NULL )
5339 if( upchild !=
NULL )
5364 val = (val - constant) / scalar;
5433 SCIPsetDebugMsg(
set,
"fixing continuous variable <%s> with value %g and bounds [%.15g, %.15g], priority %d (current lower bound: %g)\n",
5465 SCIPsetDebugMsg(
set,
"continuous branch on variable <%s> with bounds [%.15g, %.15g], priority %d (current lower bound: %g), node %p\n",
5491 SCIPsetDebugMsg(
set,
"continuous branch on variable <%s> with value %g, priority %d (current lower bound: %g)\n",
5516 center = (ub + lb) / 2.0;
5520 uplb = downub + 1.0;
5525 downub = uplb - 1.0;
5537 downub = fixval - 1.0;
5541 uplb = fixval + 1.0;
5543 SCIPsetDebugMsg(
set,
"integral branch on variable <%s> with value %g, priority %d (current lower bound: %g)\n",
5550 uplb = downub + 1.0;
5552 SCIPsetDebugMsg(
set,
"fractional branch on variable <%s> with value %g, root value %g, priority %d (current lower bound: %g)\n",
5570 SCIPsetDebugMsg(
set,
" -> creating child: <%s> <= %g (priority: %g, estimate: %g)\n",
5573 SCIP_CALL(
SCIPnodeAddBoundchg(node, blkmem,
set, stat, transprob, origprob, tree, reopt, lp, branchcand, eventqueue,
5578 if( downchild !=
NULL )
5587 SCIPsetDebugMsg(
set,
" -> creating child: <%s> == %g (priority: %g, estimate: %g)\n",
5592 SCIP_CALL(
SCIPnodeAddBoundchg(node, blkmem,
set, stat, transprob, origprob, tree, reopt, lp, branchcand, eventqueue,
5597 SCIP_CALL(
SCIPnodeAddBoundchg(node, blkmem,
set, stat, transprob, origprob, tree, reopt, lp, branchcand, eventqueue,
5603 if( eqchild !=
NULL )
5615 SCIPsetDebugMsg(
set,
" -> creating child: <%s> >= %g (priority: %g, estimate: %g)\n",
5618 SCIP_CALL(
SCIPnodeAddBoundchg(node, blkmem,
set, stat, transprob, origprob, tree, reopt, lp, branchcand, eventqueue,
5623 if( upchild !=
NULL )
5655 assert(tree !=
NULL);
5656 assert(
set !=
NULL);
5657 assert(var !=
NULL);
5665 if( downchild !=
NULL )
5667 if( upchild !=
NULL )
5722 SCIPsetDebugMsg(
set,
" -> creating child: <%s> <= %g (priority: %g, estimate: %g)\n",
5726 SCIP_CALL(
SCIPnodeAddBoundchg(node, blkmem,
set, stat, transprob, origprob, tree, reopt, lp, branchcand, eventqueue,
NULL,
5731 if( downchild !=
NULL )
5742 SCIPsetDebugMsg(
set,
" -> creating child: <%s> >= %g (priority: %g, estimate: %g)\n",
5746 SCIP_CALL(
SCIPnodeAddBoundchg(node, blkmem,
set, stat, transprob, origprob, tree, reopt, lp, branchcand, eventqueue,
5751 if( upchild !=
NULL )
5805 assert(tree !=
NULL);
5806 assert(
set !=
NULL);
5807 assert(var !=
NULL);
5809 assert(minwidth >= 0.0);
5820 SCIP_CALL(
SCIPtreeBranchVar(tree, reopt, blkmem,
set, stat, transprob, origprob, lp, branchcand, eventqueue, var, val,
5821 &downchild, &fixchild, &upchild) );
5823 if( nchildren !=
NULL )
5824 *nchildren = (downchild !=
NULL ? 1 : 0) + (fixchild !=
NULL ? 1 : 0) + (upchild !=
NULL ? 1 : 0);
5851 val = (val - constant) / scalar;
5925 else if( widthfactor == 1.0 )
5943 assert(widthfactor > 1.0);
5945 width *= (widthfactor - 1.0) / (
pow(widthfactor, (
SCIP_Real)(n/2)) - 1.0);
5947 width /= 0.5 + widthfactor * (
pow(widthfactor, (
SCIP_Real)(n/2)) - 1.0) / (widthfactor - 1.0);
5950 minwidth =
MAX(1.0, minwidth);
5951 if( width < minwidth )
5955 SCIPsetDebugMsg(
set,
"%d-ary branching on variable <%s> [%g, %g] around %g, initial width = %g\n",
5958 if( nchildren !=
NULL )
5965 left = val - width/2.0;
5966 right = val + width/2.0;
5983 SCIPsetDebugMsg(
set,
" -> creating middle child: %g <= <%s> <= %g (priority: %g, estimate: %g, width: %g)\n",
5984 left,
SCIPvarGetName(var), right, priority, estimate, right - left);
5987 SCIP_CALL(
SCIPnodeAddBoundchg(node, blkmem,
set, stat, transprob, origprob, tree, reopt, lp, branchcand,
5989 SCIP_CALL(
SCIPnodeAddBoundchg(node, blkmem,
set, stat, transprob, origprob, tree, reopt, lp, branchcand, eventqueue,
5994 if( nchildren !=
NULL )
6006 width *= widthfactor;
6014 if( right - left < 0.5 )
6031 for( i = 0; i < n; ++i )
6062 SCIPsetDebugMsg(
set,
" -> creating left child: %g <= <%s> <= %g (priority: %g, estimate: %g, width: %g)\n",
6068 SCIP_CALL(
SCIPnodeAddBoundchg(node, blkmem,
set, stat, transprob, origprob, tree, reopt, lp, branchcand, eventqueue,
6071 SCIP_CALL(
SCIPnodeAddBoundchg(node, blkmem,
set, stat, transprob, origprob, tree, reopt, lp, branchcand, eventqueue,
6076 if( nchildren !=
NULL )
6096 bnd = right + width;
6113 SCIPsetDebugMsg(
set,
" -> creating right child: %g <= <%s> <= %g (priority: %g, estimate: %g, width: %g)\n",
6114 right,
SCIPvarGetName(var), bnd, priority, estimate, bnd - right);
6117 SCIP_CALL(
SCIPnodeAddBoundchg(node, blkmem,
set, stat, transprob, origprob, tree, reopt, lp, branchcand, eventqueue,
6121 SCIP_CALL(
SCIPnodeAddBoundchg(node, blkmem,
set, stat, transprob, origprob, tree, reopt, lp, branchcand, eventqueue,
6127 if( nchildren !=
NULL )
6135 width *= widthfactor;
6144 #define ARRAYGROWTH 5 6154 int idx = preferred ? 0 : 1;
6157 assert(pos < tree->divebdchgsize[idx]);
6186 int idx = preferred ? 0 : 1;
6188 assert(variables !=
NULL);
6189 assert(directions !=
NULL);
6190 assert(values !=
NULL);
6191 assert(ndivebdchgs !=
NULL);
6206 for( p = 0; p < 2; ++p )
6226 assert(tree !=
NULL);
6229 assert(blkmem !=
NULL);
6230 assert(
set !=
NULL);
6241 assert(node !=
NULL);
6265 SCIPsetDebugMsg(
set,
"created probing root node #%" SCIP_LONGINT_FORMAT
" at depth %d\n",
6273 SCIPsetDebugMsg(
set,
"created probing child node #%" SCIP_LONGINT_FORMAT
" at depth %d, probing depth %d\n",
6307 assert(tree !=
NULL);
6313 SCIPsetDebugMsg(
set,
"probing started in depth %d (LP flushed: %u, LP solved: %u, solstat: %d), probing root in depth %d\n",
6380 assert(tree !=
NULL);
6411 assert(node !=
NULL);
6416 if( lpistate ==
NULL )
6425 if( lpistate !=
NULL )
6428 lpwasprimfeas, lpwasdualfeas) );
6432 if( lpinorms !=
NULL )
6453 assert(tree !=
NULL);
6494 assert(tree !=
NULL);
6510 assert(newpathlen >= 1);
6513 if( newpathlen < tree->pathlen )
6525 while( tree->
pathlen > newpathlen )
6574 assert(tree->
pathlen == newpathlen);
6602 SCIP_CALL(
treeApplyPendingBdchgs(tree, reopt, blkmem,
set, stat, transprob, origprob, lp, branchcand, eventqueue, cliquetable) );
6637 assert(tree !=
NULL);
6642 SCIP_CALL(
treeBacktrackProbing(tree, reopt, blkmem,
set, stat, transprob, origprob, lp, relaxation, primal, branchcand,
6643 eventqueue, eventfilter, cliquetable, probingdepth) );
6672 assert(tree !=
NULL);
6683 assert(
set !=
NULL);
6686 SCIP_CALL(
treeBacktrackProbing(tree, reopt, blkmem,
set, stat, transprob, origprob, lp, relaxation, primal, branchcand,
6687 eventqueue, eventfilter, cliquetable, -1) );
6730 SCIP_CALL(
SCIPlpSolveAndEval(lp,
set, messagehdlr, blkmem, stat, eventqueue, eventfilter, transprob, -1LL,
FALSE,
FALSE,
FALSE, &lperror) );
6734 "(node %" SCIP_LONGINT_FORMAT
") unresolved numerical troubles while resolving LP %" SCIP_LONGINT_FORMAT
" after probing\n",
6745 "LP was not resolved to a sufficient status after probing\n");
6780 SCIPsetDebugMsg(
set,
"clearing lp state at end of probing mode because LP was initially unsolved\n");
6814 assert(tree !=
NULL);
6840 assert(tree !=
NULL);
6867 assert(tree !=
NULL);
6870 assert(nodesel !=
NULL);
6894 assert(tree !=
NULL);
6897 assert(nodesel !=
NULL);
6916 assert(tree !=
NULL);
6933 assert(tree !=
NULL);
6936 assert(nodesel !=
NULL);
6944 bestnode = bestchild;
6946 bestnode = bestsibling;
6948 bestnode = bestleaf;
6964 assert(tree !=
NULL);
6965 assert(
set !=
NULL);
7004 assert(tree !=
NULL);
7005 assert(
set !=
NULL);
7020 lowerboundnode = tree->
children[i];
7035 lowerboundnode = tree->
siblings[i];
7042 return lowerboundnode;
7055 assert(tree !=
NULL);
7084 return nnodes == 0 ? 0.0 : lowerboundsum/
nnodes;
7100 #undef SCIPnodeGetType 7101 #undef SCIPnodeGetNumber 7102 #undef SCIPnodeGetDepth 7103 #undef SCIPnodeGetLowerbound 7104 #undef SCIPnodeGetEstimate 7105 #undef SCIPnodeGetDomchg 7106 #undef SCIPnodeGetParent 7107 #undef SCIPnodeGetConssetchg 7108 #undef SCIPnodeIsActive 7109 #undef SCIPnodeIsPropagatedAgain 7110 #undef SCIPtreeGetNLeaves 7111 #undef SCIPtreeGetNChildren 7112 #undef SCIPtreeGetNSiblings 7113 #undef SCIPtreeGetNNodes 7114 #undef SCIPtreeIsPathComplete 7115 #undef SCIPtreeProbing 7116 #undef SCIPtreeGetProbingRoot 7117 #undef SCIPtreeGetProbingDepth 7118 #undef SCIPtreeGetFocusNode 7119 #undef SCIPtreeGetFocusDepth 7120 #undef SCIPtreeHasFocusNodeLP 7121 #undef SCIPtreeSetFocusNodeLP 7122 #undef SCIPtreeIsFocusNodeLPConstructed 7123 #undef SCIPtreeInRepropagation 7124 #undef SCIPtreeGetCurrentNode 7125 #undef SCIPtreeGetCurrentDepth 7126 #undef SCIPtreeHasCurrentNodeLP 7127 #undef SCIPtreeGetEffectiveRootDepth 7128 #undef SCIPtreeGetRootNode 7129 #undef SCIPtreeProbingObjChanged 7130 #undef SCIPtreeMarkProbingObjChanged 7137 assert(node !=
NULL);
7147 assert(node !=
NULL);
7157 assert(node !=
NULL);
7159 return (
int) node->
depth;
7167 assert(node !=
NULL);
7177 assert(node !=
NULL);
7187 assert(node !=
NULL);
7198 assert(node !=
NULL);
7208 node->
reopttype = (
unsigned int) reopttype;
7218 assert(node !=
NULL);
7229 assert(node !=
NULL);
7230 assert(
id <= 536870911);
7242 assert(node !=
NULL);
7260 assert(node !=
NULL);
7262 count_branchings = (nbranchings !=
NULL);
7263 count_consprop = (nconsprop !=
NULL);
7264 count_prop = (nprop !=
NULL);
7267 if( count_branchings )
7269 if( count_consprop )
7307 int npseudobranchvars;
7309 assert(node !=
NULL);
7317 npseudobranchvars = 0;
7319 assert(boundchgs !=
NULL);
7320 assert(nboundchgs >= 0);
7325 for( i = nboundchgs-1; i >= 0; i--)
7336 npseudobranchvars++;
7341 return npseudobranchvars;
7360 assert(node !=
NULL);
7361 assert(vars !=
NULL);
7362 assert(bounds !=
NULL);
7363 assert(boundtypes !=
NULL);
7364 assert(nvars !=
NULL);
7365 assert(varssize >= 0);
7375 assert(boundchgs !=
NULL);
7376 assert(nboundchgs >= 0);
7381 for( i = nboundchgs-1; i >= 0; i--)
7397 if( varssize >= *nvars )
7401 for( i = i+1; i < nboundchgs; i++)
7412 vars[j] = boundchgs[i].
var;
7427 assert(node !=
NULL);
7448 assert(node !=
NULL);
7449 assert(branchvars !=
NULL);
7450 assert(branchbounds !=
NULL);
7451 assert(boundtypes !=
NULL);
7452 assert(nbranchvars !=
NULL);
7453 assert(branchvarssize >= 0);
7463 assert(boundchgs !=
NULL);
7464 assert(nboundchgs >= 0);
7469 for( i = 0; i < nboundchgs; i++)
7479 for( ; i < nboundchgs; i++)
7484 if( branchvarssize >= *nbranchvars )
7486 for( i = 0; i < *nbranchvars; i++)
7489 branchvars[i] = boundchgs[i].
var;
7491 branchbounds[i] = boundchgs[i].
newbound;
7508 assert(node !=
NULL);
7509 assert(branchvars !=
NULL);
7510 assert(branchbounds !=
NULL);
7511 assert(boundtypes !=
NULL);
7512 assert(nbranchvars !=
NULL);
7513 assert(branchvarssize >= 0);
7519 int nodenbranchvars;
7523 start = *nbranchvars < branchvarssize - 1 ? *nbranchvars : branchvarssize - 1;
7524 size = *nbranchvars > branchvarssize ? 0 : branchvarssize-(*nbranchvars);
7527 *nbranchvars += nodenbranchvars;
7546 assert(node !=
NULL);
7547 assert(parent !=
NULL);
7548 assert(branchvars !=
NULL);
7549 assert(branchbounds !=
NULL);
7550 assert(boundtypes !=
NULL);
7551 assert(nbranchvars !=
NULL);
7552 assert(branchvarssize >= 0);
7556 while( node != parent )
7558 int nodenbranchvars;
7562 start = *nbranchvars < branchvarssize - 1 ? *nbranchvars : branchvarssize - 1;
7563 size = *nbranchvars > branchvarssize ? 0 : branchvarssize-(*nbranchvars);
7566 *nbranchvars += nodenbranchvars;
7583 int conspropvarssize
7592 assert(node !=
NULL);
7593 assert(vars !=
NULL);
7594 assert(varbounds !=
NULL);
7595 assert(varboundtypes !=
NULL);
7596 assert(nconspropvars !=
NULL);
7597 assert(conspropvarssize >= 0);
7599 (*nconspropvars) = 0;
7607 assert(boundchgs !=
NULL);
7608 assert(nboundchgs >= 0);
7613 while( i < nboundchgs
7621 for(i = nskip; i < first_dual; i++)
7637 if( conspropvarssize >= *nconspropvars )
7641 for(i = nskip, pos = 0; i < first_dual; i++)
7647 vars[pos] = boundchgs[i].
var;
7649 varbounds[pos] = boundchgs[i].
newbound;
7680 assert(node !=
NULL);
7681 assert(vars !=
NULL);
7682 assert(varbounds !=
NULL);
7683 assert(varboundtypes !=
NULL);
7684 assert(nbranchvars !=
NULL);
7685 assert(branchvarssize >= 0);
7695 assert(boundchgs !=
NULL);
7696 assert(nboundchgs >= 0);
7700 while( i < nboundchgs
7708 for( ; i < nboundchgs; i++)
7721 if( branchvarssize >= *nbranchvars )
7724 for(i = first_dual, p = start; i < nboundchgs; i++)
7731 vars[p] = boundchgs[i].
var;
7733 varbounds[p] = boundchgs[i].
newbound;
7764 for( i = 0; i < nboundchgs; i++)
7774 if( nbranchings > 0 )
7810 assert(node !=
NULL);
7811 assert(branchvars !=
NULL);
7812 assert(branchbounds !=
NULL);
7813 assert(boundtypes !=
NULL);
7814 assert(nbranchvars !=
NULL);
7815 assert(branchvarssize >= 0);
7823 int nodenbranchvars;
7828 start = *nbranchvars < branchvarssize - 1 ? *nbranchvars : branchvarssize - 1;
7829 size = *nbranchvars > branchvarssize ? 0 : branchvarssize-(*nbranchvars);
7830 if( *nnodes < nodeswitchsize )
7831 nodeswitches[*
nnodes] = start;
7835 *nbranchvars += nodenbranchvars;
7848 assert(node1 !=
NULL);
7849 assert(node2 !=
NULL);
7863 return (node1 == node2);
7872 assert(node1 !=
NULL);
7873 assert(node2 !=
NULL);
7886 while( node1 != node2 )
7902 assert(node !=
NULL);
7912 assert(node !=
NULL);
7922 assert(node !=
NULL);
7932 assert(tree !=
NULL);
7942 assert(tree !=
NULL);
7952 assert(tree !=
NULL);
7962 assert(tree !=
NULL);
7972 assert(tree !=
NULL);
7989 assert(tree !=
NULL);
8002 assert(tree !=
NULL);
8015 assert(tree !=
NULL);
8032 assert(tree !=
NULL);
8049 assert(tree !=
NULL);
8060 assert(tree !=
NULL);
8070 assert(tree !=
NULL);
8080 assert(tree !=
NULL);
8090 assert(tree !=
NULL);
8107 assert(tree !=
NULL);
8124 assert(tree !=
NULL);
8135 assert(tree !=
NULL);
8146 assert(tree !=
NULL);
8157 assert(tree !=
NULL);
8168 assert(tree !=
NULL);
8179 assert(tree !=
NULL);
SCIP_RETCODE SCIPtreeClear(SCIP_TREE *tree, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_LP *lp)
static SCIP_RETCODE forkAddLP(SCIP_NODE *fork, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, SCIP_EVENTFILTER *eventfilter, SCIP_LP *lp)
SCIP_DECL_SORTPTRCOMP(SCIPnodeCompLowerbound)
enum SCIP_BoundType SCIP_BOUNDTYPE
SCIP_RETCODE SCIPtreeAddDiveBoundChange(SCIP_TREE *tree, BMS_BLKMEM *blkmem, SCIP_VAR *var, SCIP_BRANCHDIR dir, SCIP_Real value, SCIP_Bool preferred)
SCIP_RETCODE SCIPlpGetProvedLowerbound(SCIP_LP *lp, SCIP_SET *set, SCIP_Real *bound)
SCIP_RETCODE SCIPtreeCreatePresolvingRoot(SCIP_TREE *tree, SCIP_REOPT *reopt, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_PRIMAL *primal, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_CONFLICT *conflict, SCIP_CONFLICTSTORE *conflictstore, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable)
void SCIPnodeGetParentBranchings(SCIP_NODE *node, SCIP_VAR **branchvars, SCIP_Real *branchbounds, SCIP_BOUNDTYPE *boundtypes, int *nbranchvars, int branchvarssize)
void SCIPnodeGetDualBoundchgs(SCIP_NODE *node, SCIP_VAR **vars, SCIP_Real *bounds, SCIP_BOUNDTYPE *boundtypes, int *nvars, int varssize)
SCIP_Real SCIPvarGetWorstBoundLocal(SCIP_VAR *var)
SCIP_Bool SCIPsetIsInfinity(SCIP_SET *set, SCIP_Real val)
void SCIPrelaxationUpdateVarObj(SCIP_RELAXATION *relaxation, SCIP_SET *set, SCIP_VAR *var, SCIP_Real oldobj, SCIP_Real newobj)
SCIP_RETCODE SCIPtreeEndProbing(SCIP_TREE *tree, SCIP_REOPT *reopt, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_LP *lp, SCIP_RELAXATION *relaxation, SCIP_PRIMAL *primal, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_EVENTFILTER *eventfilter, SCIP_CLIQUETABLE *cliquetable)
#define BMSfreeBlockMemoryArrayNull(mem, ptr, num)
internal methods for managing events
SCIP_RETCODE SCIPlpFreeNorms(SCIP_LP *lp, BMS_BLKMEM *blkmem, SCIP_LPINORMS **lpinorms)
SCIP_RETCODE SCIPnodepqBound(SCIP_NODEPQ *nodepq, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_Real cutoffbound)
SCIP_RETCODE SCIPnodeCreateChild(SCIP_NODE **node, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_TREE *tree, SCIP_Real nodeselprio, SCIP_Real estimate)
SCIP_VAR ** SCIPcliqueGetVars(SCIP_CLIQUE *clique)
SCIP_Bool SCIPsetIsLE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_PSEUDOFORK * pseudofork
SCIP_RETCODE SCIPtreeBranchVar(SCIP_TREE *tree, SCIP_REOPT *reopt, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_VAR *var, SCIP_Real val, SCIP_NODE **downchild, SCIP_NODE **eqchild, SCIP_NODE **upchild)
int SCIPlpGetNNewrows(SCIP_LP *lp)
SCIP_Bool SCIPsetIsFeasZero(SCIP_SET *set, SCIP_Real val)
void SCIPvisualRepropagatedNode(SCIP_VISUAL *visual, SCIP_STAT *stat, SCIP_NODE *node)
static SCIP_RETCODE treeEnsurePendingbdchgsMem(SCIP_TREE *tree, SCIP_SET *set, int num)
unsigned int lpwasdualfeas
void SCIPvarMarkNotDeletable(SCIP_VAR *var)
SCIP_Bool SCIPtreeHasFocusNodeLP(SCIP_TREE *tree)
static SCIP_RETCODE junctionInit(SCIP_JUNCTION *junction, SCIP_TREE *tree)
SCIP_Bool SCIPlpDiving(SCIP_LP *lp)
SCIP_RETCODE SCIPconssetchgFree(SCIP_CONSSETCHG **conssetchg, BMS_BLKMEM *blkmem, SCIP_SET *set)
#define SCIPdebugRemoveNode(blkmem, set, node)
#define BMSfreeMemoryArrayNull(ptr)
SCIP_RETCODE SCIPlpShrinkRows(SCIP_LP *lp, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, SCIP_EVENTFILTER *eventfilter, int newnrows)
void SCIPlpSetIsRelax(SCIP_LP *lp, SCIP_Bool relax)
static SCIP_RETCODE probingnodeUpdate(SCIP_PROBINGNODE *probingnode, BMS_BLKMEM *blkmem, SCIP_TREE *tree, SCIP_LP *lp)
internal methods for branch and bound tree
SCIP_Real SCIPtreeCalcChildEstimate(SCIP_TREE *tree, SCIP_SET *set, SCIP_STAT *stat, SCIP_VAR *var, SCIP_Real targetvalue)
SCIP_RETCODE SCIPtreeBranchVarHole(SCIP_TREE *tree, SCIP_REOPT *reopt, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_VAR *var, SCIP_Real left, SCIP_Real right, SCIP_NODE **downchild, SCIP_NODE **upchild)
SCIP_Longint ndeactivatednodes
void SCIPtreeSetFocusNodeLP(SCIP_TREE *tree, SCIP_Bool solvelp)
SCIP_NODE * SCIPnodesGetCommonAncestor(SCIP_NODE *node1, SCIP_NODE *node2)
SCIP_RETCODE SCIPeventqueueProcess(SCIP_EVENTQUEUE *eventqueue, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_PRIMAL *primal, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTFILTER *eventfilter)
SCIP_BRANCHDIR SCIPvarGetBranchDirection(SCIP_VAR *var)
union SCIP_BoundChg::@11 data
SCIP_RETCODE SCIPlpFlush(SCIP_LP *lp, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue)
SCIP_NODE * SCIPtreeGetLowerboundNode(SCIP_TREE *tree, SCIP_SET *set)
SCIP_Real SCIPsetFloor(SCIP_SET *set, SCIP_Real val)
SCIP_Bool SCIPsetIsFeasEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_RETCODE SCIPlpRemoveAllObsoletes(SCIP_LP *lp, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_EVENTFILTER *eventfilter)
SCIP_Real SCIPnodeGetLowerbound(SCIP_NODE *node)
methods for implications, variable bounds, and cliques
SCIP_Real SCIPvarGetLbGlobal(SCIP_VAR *var)
int SCIPnodepqCompare(SCIP_NODEPQ *nodepq, SCIP_SET *set, SCIP_NODE *node1, SCIP_NODE *node2)
SCIP_Longint focuslpstateforklpcount
static SCIP_RETCODE pseudoforkCreate(SCIP_PSEUDOFORK **pseudofork, BMS_BLKMEM *blkmem, SCIP_TREE *tree, SCIP_LP *lp)
SCIP_RETCODE SCIPtreeSetNodesel(SCIP_TREE *tree, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_STAT *stat, SCIP_NODESEL *nodesel)
void SCIPgmlWriteArc(FILE *file, unsigned int source, unsigned int target, const char *label, const char *color)
static SCIP_RETCODE treeEnsurePathMem(SCIP_TREE *tree, SCIP_SET *set, int num)
internal methods for clocks and timing issues
SCIPInterval pow(const SCIPInterval &x, const SCIPInterval &y)
SCIP_BRANCHDIR * divebdchgdirs[2]
SCIP_BOUNDCHG * boundchgs
SCIP_Bool SCIPsetIsPositive(SCIP_SET *set, SCIP_Real val)
int SCIPtreeGetProbingDepth(SCIP_TREE *tree)
SCIP_RETCODE SCIPnodeDelCons(SCIP_NODE *node, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_TREE *tree, SCIP_CONS *cons)
SCIP_RETCODE SCIPnodeAddBoundinfer(SCIP_NODE *node, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, SCIP_VAR *var, SCIP_Real newbound, SCIP_BOUNDTYPE boundtype, SCIP_CONS *infercons, SCIP_PROP *inferprop, int inferinfo, SCIP_Bool probingchange)
SCIP_Real SCIPvarGetLbLocal(SCIP_VAR *var)
void SCIProwCapture(SCIP_ROW *row)
SCIP_CLIQUE ** SCIPvarGetCliques(SCIP_VAR *var, SCIP_Bool varfixing)
SCIP_PROBINGNODE * probingnode
SCIP_RETCODE SCIPtreeCreate(SCIP_TREE **tree, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_NODESEL *nodesel)
unsigned int repropsubtreemark
SCIP_NODE * SCIPnodeGetParent(SCIP_NODE *node)
void SCIPgmlWriteNode(FILE *file, unsigned int id, const char *label, const char *nodetype, const char *fillcolor, const char *bordercolor)
void SCIPnodeGetAddedConss(SCIP_NODE *node, SCIP_CONS **addedconss, int *naddedconss, int addedconsssize)
void SCIPnodeSetReoptID(SCIP_NODE *node, unsigned int id)
SCIP_RETCODE SCIPvarAddHoleGlobal(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_Real left, SCIP_Real right, SCIP_Bool *added)
interface methods for specific LP solvers
SCIP_Bool SCIPvarIsBinary(SCIP_VAR *var)
SCIP_NODE * SCIPtreeGetBestNode(SCIP_TREE *tree, SCIP_SET *set)
SCIP_Real SCIPsetInfinity(SCIP_SET *set)
SCIP_NODE * SCIPtreeGetProbingRoot(SCIP_TREE *tree)
SCIP_Real SCIPvarGetSol(SCIP_VAR *var, SCIP_Bool getlpval)
SCIP_NODE * SCIPtreeGetBestChild(SCIP_TREE *tree, SCIP_SET *set)
SCIP_Real * divebdchgvals[2]
SCIP_Real SCIPvarGetRootSol(SCIP_VAR *var)
int SCIPnodepqLen(const SCIP_NODEPQ *nodepq)
SCIP_RETCODE SCIPlpFreeState(SCIP_LP *lp, BMS_BLKMEM *blkmem, SCIP_LPISTATE **lpistate)
void SCIPgmlWriteClosing(FILE *file)
SCIP_BOUNDTYPE SCIPboundchgGetBoundtype(SCIP_BOUNDCHG *boundchg)
static SCIP_RETCODE subrootFree(SCIP_SUBROOT **subroot, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_LP *lp)
void SCIPclockStop(SCIP_CLOCK *clck, SCIP_SET *set)
static void forkCaptureLPIState(SCIP_FORK *fork, int nuses)
SCIP_LPINORMS * probinglpinorms
static SCIP_RETCODE focusnodeToLeaf(BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_NODE *lpstatefork, SCIP_Real cutoffbound)
static void treeRemoveSibling(SCIP_TREE *tree, SCIP_NODE *sibling)
SCIP_Bool SCIPsetIsFeasIntegral(SCIP_SET *set, SCIP_Real val)
SCIP_RETCODE SCIPdomchgUndo(SCIP_DOMCHG *domchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue)
SCIP_Real SCIPrelDiff(SCIP_Real val1, SCIP_Real val2)
void SCIPclockStart(SCIP_CLOCK *clck, SCIP_SET *set)
SCIP_Longint ncreatednodes
int SCIPsnprintf(char *t, int len, const char *s,...)
SCIP_Bool SCIPsetIsZero(SCIP_SET *set, SCIP_Real val)
SCIP_RETCODE SCIPeventqueueDelay(SCIP_EVENTQUEUE *eventqueue)
SCIP_NODE * SCIPnodepqGetLowerboundNode(SCIP_NODEPQ *nodepq, SCIP_SET *set)
static SCIP_RETCODE treeBacktrackProbing(SCIP_TREE *tree, SCIP_REOPT *reopt, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_LP *lp, SCIP_RELAXATION *relaxation, SCIP_PRIMAL *primal, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_EVENTFILTER *eventfilter, SCIP_CLIQUETABLE *cliquetable, int probingdepth)
enum SCIP_Retcode SCIP_RETCODE
SCIP_RETCODE SCIPtreeLoadLPState(SCIP_TREE *tree, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_LP *lp)
SCIP_RETCODE SCIPlpGetState(SCIP_LP *lp, BMS_BLKMEM *blkmem, SCIP_LPISTATE **lpistate)
int SCIPtreeGetCurrentDepth(SCIP_TREE *tree)
SCIP_Real SCIPnodepqGetLowerboundSum(SCIP_NODEPQ *nodepq)
int SCIPvarGetProbindex(SCIP_VAR *var)
SCIP_RETCODE SCIPlpSetState(SCIP_LP *lp, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, SCIP_LPISTATE *lpistate, SCIP_Bool wasprimfeas, SCIP_Bool wasdualfeas)
int SCIPsetCalcMemGrowSize(SCIP_SET *set, int num)
SCIP_NODE * SCIPtreeGetFocusNode(SCIP_TREE *tree)
SCIP_Bool probinglpwasflushed
SCIP_Real SCIPvarGetAvgInferences(SCIP_VAR *var, SCIP_STAT *stat, SCIP_BRANCHDIR dir)
SCIP_RETCODE SCIPlpSolveAndEval(SCIP_LP *lp, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_EVENTFILTER *eventfilter, SCIP_PROB *prob, SCIP_Longint itlim, SCIP_Bool limitresolveiters, SCIP_Bool aging, SCIP_Bool keepsol, SCIP_Bool *lperror)
SCIP_ROW ** SCIPlpGetRows(SCIP_LP *lp)
SCIP_RETCODE SCIPlpCleanupAll(SCIP_LP *lp, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_EVENTFILTER *eventfilter, SCIP_Bool root)
SCIP_Bool probingsolvedlp
SCIP_RETCODE SCIPlpSetNorms(SCIP_LP *lp, BMS_BLKMEM *blkmem, SCIP_LPINORMS *lpinorms)
int SCIPnodeGetDepth(SCIP_NODE *node)
methods for creating output for visualization tools (VBC, BAK)
static SCIP_RETCODE treeAddChild(SCIP_TREE *tree, SCIP_SET *set, SCIP_NODE *child, SCIP_Real nodeselprio)
SCIP_Bool SCIPvarIsDeletable(SCIP_VAR *var)
int SCIPvarGetConflictingBdchgDepth(SCIP_VAR *var, SCIP_SET *set, SCIP_BOUNDTYPE boundtype, SCIP_Real bound)
#define BMSfreeMemory(ptr)
SCIP_RETCODE SCIPlpEndProbing(SCIP_LP *lp)
SCIP_NODESEL * SCIPnodepqGetNodesel(SCIP_NODEPQ *nodepq)
void SCIPvarAdjustLb(SCIP_VAR *var, SCIP_SET *set, SCIP_Real *lb)
static void treeChildrenToSiblings(SCIP_TREE *tree)
unsigned int lpwasdualfeas
SCIP_CONS ** disabledconss
static SCIP_RETCODE probingnodeFree(SCIP_PROBINGNODE **probingnode, BMS_BLKMEM *blkmem, SCIP_LP *lp)
SCIP_LPSOLSTAT SCIPlpGetSolstat(SCIP_LP *lp)
SCIP_Real SCIPsetCeil(SCIP_SET *set, SCIP_Real val)
static SCIP_RETCODE treeCreateProbingNode(SCIP_TREE *tree, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_LP *lp)
#define SCIPstatIncrement(stat, set, field)
internal methods for LP management
SCIP_Bool SCIPconsIsActive(SCIP_CONS *cons)
int SCIPvarGetNCliques(SCIP_VAR *var, SCIP_Bool varfixing)
SCIP_Bool SCIPtreeIsPathComplete(SCIP_TREE *tree)
SCIP_Bool SCIPtreeIsFocusNodeLPConstructed(SCIP_TREE *tree)
void SCIPnodeGetAncestorBranchings(SCIP_NODE *node, SCIP_VAR **branchvars, SCIP_Real *branchbounds, SCIP_BOUNDTYPE *boundtypes, int *nbranchvars, int branchvarssize)
internal methods for collecting primal CIP solutions and primal informations
SCIP_Bool SCIPconsIsGlobal(SCIP_CONS *cons)
int SCIPlpGetNCols(SCIP_LP *lp)
SCIP_Bool SCIPsetIsGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
internal methods for propagators
SCIP_Bool SCIPclockIsRunning(SCIP_CLOCK *clck)
SCIP_RETCODE SCIPnodepqInsert(SCIP_NODEPQ *nodepq, SCIP_SET *set, SCIP_NODE *node)
int SCIPtreeGetFocusDepth(SCIP_TREE *tree)
static SCIP_RETCODE pseudoforkAddLP(SCIP_NODE *pseudofork, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, SCIP_EVENTFILTER *eventfilter, SCIP_LP *lp)
enum SCIP_BranchDir SCIP_BRANCHDIR
SCIP_Longint SCIPnodeGetNumber(SCIP_NODE *node)
int SCIPtreeGetNChildren(SCIP_TREE *tree)
SCIP_NODE * SCIPtreeGetBestLeaf(SCIP_TREE *tree)
static SCIP_RETCODE nodeRepropagate(SCIP_NODE *node, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_PRIMAL *primal, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_CONFLICT *conflict, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, SCIP_Bool *cutoff)
SCIP_RETCODE SCIPnodeCutoff(SCIP_NODE *node, SCIP_SET *set, SCIP_STAT *stat, SCIP_TREE *tree, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_REOPT *reopt, SCIP_LP *lp, BMS_BLKMEM *blkmem)
SCIP_Real SCIPvarGetUbGlobal(SCIP_VAR *var)
SCIP_Bool SCIPsetIsLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_VAR * SCIPvarGetProbvar(SCIP_VAR *var)
SCIP_Bool probinglpwassolved
SCIP_RETCODE SCIPlpCleanupNew(SCIP_LP *lp, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_EVENTFILTER *eventfilter, SCIP_Bool root)
SCIP_Real SCIPtreeCalcNodeselPriority(SCIP_TREE *tree, SCIP_SET *set, SCIP_STAT *stat, SCIP_VAR *var, SCIP_BRANCHDIR branchdir, SCIP_Real targetvalue)
SCIP_REOPTTYPE SCIPnodeGetReopttype(SCIP_NODE *node)
SCIP_Bool probingloadlpistate
static SCIP_RETCODE subrootConstructLP(SCIP_NODE *subroot, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, SCIP_EVENTFILTER *eventfilter, SCIP_LP *lp)
SCIP_Bool SCIPtreeProbing(SCIP_TREE *tree)
SCIP_RETCODE SCIPprobPerformVarDeletions(SCIP_PROB *prob, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand)
SCIP_RETCODE SCIPvisualNewChild(SCIP_VISUAL *visual, SCIP_SET *set, SCIP_STAT *stat, SCIP_NODE *node)
void SCIPnodeUpdateLowerbound(SCIP_NODE *node, SCIP_STAT *stat, SCIP_SET *set, SCIP_TREE *tree, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_Real newbound)
SCIP_Real SCIPvarGetPseudocost(SCIP_VAR *var, SCIP_STAT *stat, SCIP_Real solvaldelta)
int SCIPlpGetNNewcols(SCIP_LP *lp)
#define BMSduplicateBlockMemoryArray(mem, ptr, source, num)
SCIP_RETCODE SCIPconssetchgApply(SCIP_CONSSETCHG *conssetchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, int depth, SCIP_Bool focusnode)
SCIP_Bool probingobjchanged
SCIP_RETCODE SCIPlpStartProbing(SCIP_LP *lp)
SCIP_RETCODE SCIPdomchgApplyGlobal(SCIP_DOMCHG *domchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, SCIP_Bool *cutoff)
SCIP_Bool SCIPnodesSharePath(SCIP_NODE *node1, SCIP_NODE *node2)
void SCIPnodeGetAncestorBranchingPath(SCIP_NODE *node, SCIP_VAR **branchvars, SCIP_Real *branchbounds, SCIP_BOUNDTYPE *boundtypes, int *nbranchvars, int branchvarssize, int *nodeswitches, int *nnodes, int nodeswitchsize)
#define BMSfreeMemoryArray(ptr)
static SCIP_RETCODE forkReleaseLPIState(SCIP_FORK *fork, BMS_BLKMEM *blkmem, SCIP_LP *lp)
static void treeFindSwitchForks(SCIP_TREE *tree, SCIP_NODE *node, SCIP_NODE **commonfork, SCIP_NODE **newlpfork, SCIP_NODE **newlpstatefork, SCIP_NODE **newsubroot, SCIP_Bool *cutoff)
internal methods for storing and manipulating the main problem
void SCIPmessagePrintVerbInfo(SCIP_MESSAGEHDLR *messagehdlr, SCIP_VERBLEVEL verblevel, SCIP_VERBLEVEL msgverblevel, const char *formatstr,...)
SCIP_Bool SCIPboundchgIsRedundant(SCIP_BOUNDCHG *boundchg)
SCIP_RETCODE SCIPdomchgMakeStatic(SCIP_DOMCHG **domchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, SCIP_LP *lp)
static SCIP_RETCODE pseudoforkFree(SCIP_PSEUDOFORK **pseudofork, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_LP *lp)
SCIP_RETCODE SCIPdomchgFree(SCIP_DOMCHG **domchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, SCIP_LP *lp)
SCIP_RETCODE SCIPvarChgObj(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_PROB *prob, SCIP_PRIMAL *primal, SCIP_LP *lp, SCIP_EVENTQUEUE *eventqueue, SCIP_Real newobj)
void SCIPnodeGetNDomchg(SCIP_NODE *node, int *nbranchings, int *nconsprop, int *nprop)
static SCIP_RETCODE treeAddPendingBdchg(SCIP_TREE *tree, SCIP_SET *set, SCIP_NODE *node, SCIP_VAR *var, SCIP_Real newbound, SCIP_BOUNDTYPE boundtype, SCIP_CONS *infercons, SCIP_PROP *inferprop, int inferinfo, SCIP_Bool probingchange)
SCIP_RETCODE SCIPlpAddCol(SCIP_LP *lp, SCIP_SET *set, SCIP_COL *col, int depth)
SCIP_Bool SCIPtreeInRepropagation(SCIP_TREE *tree)
SCIP_RETCODE SCIPnodeFocus(SCIP_NODE **node, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_PRIMAL *primal, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_CONFLICT *conflict, SCIP_CONFLICTSTORE *conflictstore, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, SCIP_Bool *cutoff, SCIP_Bool postponed, SCIP_Bool exitsolve)
#define SCIPdebugCheckInference(blkmem, set, node, var, newbound, boundtype)
SCIP_Bool SCIPsetIsRelEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_RETCODE SCIPvarRelease(SCIP_VAR **var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, SCIP_LP *lp)
SCIP_RETCODE SCIPlpShrinkCols(SCIP_LP *lp, SCIP_SET *set, int newncols)
SCIP_COL ** SCIPlpGetCols(SCIP_LP *lp)
SCIP_LPISTATE * probinglpistate
SCIP_RETCODE SCIPnodepqSetNodesel(SCIP_NODEPQ **nodepq, SCIP_SET *set, SCIP_NODESEL *nodesel)
void SCIPnodeMarkPropagated(SCIP_NODE *node, SCIP_TREE *tree)
static SCIP_RETCODE focusnodeToPseudofork(BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_CLIQUETABLE *cliquetable)
SCIP_NODE * focuslpstatefork
const char * SCIPconsGetName(SCIP_CONS *cons)
void SCIPlpMarkSize(SCIP_LP *lp)
SCIP_RETCODE SCIPnodePrintAncestorBranchings(SCIP_NODE *node, FILE *file)
const char * SCIPvarGetName(SCIP_VAR *var)
SCIP_NODE * SCIPtreeGetBestSibling(SCIP_TREE *tree, SCIP_SET *set)
void SCIPnodeGetAncestorBranchingsPart(SCIP_NODE *node, SCIP_NODE *parent, SCIP_VAR **branchvars, SCIP_Real *branchbounds, SCIP_BOUNDTYPE *boundtypes, int *nbranchvars, int branchvarssize)
SCIP_Bool SCIPnodeIsPropagatedAgain(SCIP_NODE *node)
SCIP_Real SCIPsetFeasCeil(SCIP_SET *set, SCIP_Real val)
static void treeCheckPath(SCIP_TREE *tree)
SCIP_DOMCHG * SCIPnodeGetDomchg(SCIP_NODE *node)
SCIP_RETCODE SCIPlpAddRow(SCIP_LP *lp, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, SCIP_EVENTFILTER *eventfilter, SCIP_ROW *row, int depth)
SCIP_RETCODE SCIPtreeLoadLP(SCIP_TREE *tree, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, SCIP_EVENTFILTER *eventfilter, SCIP_LP *lp, SCIP_Bool *initroot)
enum SCIP_ReoptType SCIP_REOPTTYPE
int appliedeffectiverootdepth
static SCIP_RETCODE focusnodeToFork(BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_EVENTFILTER *eventfilter, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_CLIQUETABLE *cliquetable)
SCIP_Real SCIPvarGetLPSol(SCIP_VAR *var)
SCIP_Bool SCIPsetIsRelGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
static void subrootCaptureLPIState(SCIP_SUBROOT *subroot, int nuses)
internal methods for node selectors and node priority queues
static SCIP_RETCODE treeEnsureChildrenMem(SCIP_TREE *tree, SCIP_SET *set, int num)
#define SCIP_PROPTIMING_ALWAYS
internal methods for global SCIP settings
internal methods for storing conflicts
SCIP_Bool SCIPsetIsFeasGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
int SCIPlpGetNRows(SCIP_LP *lp)
SCIP_CONSSETCHG * SCIPnodeGetConssetchg(SCIP_NODE *node)
int SCIPnodeselCompare(SCIP_NODESEL *nodesel, SCIP_SET *set, SCIP_NODE *node1, SCIP_NODE *node2)
SCIP_RETCODE SCIPconsDisable(SCIP_CONS *cons, SCIP_SET *set, SCIP_STAT *stat)
internal methods for relaxators
SCIP_Bool SCIPsetIsEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIPdebugCheckLbGlobal(scip, var, lb)
SCIP_Real SCIPlpGetObjval(SCIP_LP *lp, SCIP_SET *set, SCIP_PROB *prob)
SCIP_Longint ncreatednodesrun
SCIP_Bool SCIPsetIsFeasLE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIPdebugCheckUbGlobal(scip, var, ub)
SCIP_RETCODE SCIProwRelease(SCIP_ROW **row, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_LP *lp)
SCIP_RETCODE SCIPnodepqFree(SCIP_NODEPQ **nodepq, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_TREE *tree, SCIP_LP *lp)
SCIP_Real SCIPtreeGetAvgLowerbound(SCIP_TREE *tree, SCIP_Real cutoffbound)
void SCIPvarAdjustBd(SCIP_VAR *var, SCIP_SET *set, SCIP_BOUNDTYPE boundtype, SCIP_Real *bd)
void SCIPtreeClearDiveBoundChanges(SCIP_TREE *tree)
#define BMSfreeBlockMemory(mem, ptr)
data structures and methods for collecting reoptimization information
internal methods for problem variables
void SCIPnodeSetEstimate(SCIP_NODE *node, SCIP_SET *set, SCIP_Real newestimate)
int SCIPnodeGetNDualBndchgs(SCIP_NODE *node)
static SCIP_RETCODE nodeReleaseParent(SCIP_NODE *node, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_TREE *tree, SCIP_LP *lp)
SCIP_BOUNDTYPE * SCIPvarGetImplTypes(SCIP_VAR *var, SCIP_Bool varfixing)
unsigned int boundchgtype
void SCIPnodePropagateAgain(SCIP_NODE *node, SCIP_SET *set, SCIP_STAT *stat, SCIP_TREE *tree)
SCIP_INFERENCEDATA inferencedata
SCIP_RETCODE SCIPlpClear(SCIP_LP *lp, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, SCIP_EVENTFILTER *eventfilter)
static SCIP_RETCODE treeUpdatePathLPSize(SCIP_TREE *tree, int startdepth)
int SCIPtreeGetEffectiveRootDepth(SCIP_TREE *tree)
void SCIPlpRecomputeLocalAndGlobalPseudoObjval(SCIP_LP *lp, SCIP_SET *set, SCIP_PROB *prob)
static SCIP_RETCODE treeSwitchPath(SCIP_TREE *tree, SCIP_REOPT *reopt, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_PRIMAL *primal, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_CONFLICT *conflict, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, SCIP_NODE *fork, SCIP_NODE *focusnode, SCIP_Bool *cutoff)
void SCIPvarCapture(SCIP_VAR *var)
SCIP_RETCODE SCIPreoptCheckCutoff(SCIP_REOPT *reopt, SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_NODE *node, SCIP_EVENTTYPE eventtype, SCIP_LP *lp, SCIP_LPSOLSTAT lpsolstat, SCIP_Bool isrootnode, SCIP_Bool isfocusnode, SCIP_Real lowerbound, int effectiverootdepth)
#define BMSallocBlockMemoryArray(mem, ptr, num)
int SCIPsetCalcPathGrowSize(SCIP_SET *set, int num)
SCIP_Bool focuslpconstructed
SCIP_Bool SCIPvarIsInLP(SCIP_VAR *var)
SCIP_Longint nearlybacktracks
SCIP_RETCODE SCIPtreeCreateRoot(SCIP_TREE *tree, SCIP_REOPT *reopt, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_LP *lp)
static SCIP_RETCODE nodeAssignParent(SCIP_NODE *node, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_TREE *tree, SCIP_NODE *parent, SCIP_Real nodeselprio)
SCIP_ROW ** SCIPlpGetNewrows(SCIP_LP *lp)
int SCIPvarGetBranchPriority(SCIP_VAR *var)
SCIP_RETCODE SCIPnodepqRemove(SCIP_NODEPQ *nodepq, SCIP_SET *set, SCIP_NODE *node)
void SCIPtreeGetDiveBoundChangeData(SCIP_TREE *tree, SCIP_VAR ***variables, SCIP_BRANCHDIR **directions, SCIP_Real **values, int *ndivebdchgs, SCIP_Bool preferred)
static SCIP_RETCODE focusnodeCleanupVars(BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_CLIQUETABLE *cliquetable, SCIP_Bool inlp)
int SCIPvarGetNImpls(SCIP_VAR *var, SCIP_Bool varfixing)
#define BMSfreeBlockMemoryArray(mem, ptr, num)
SCIP_Bool SCIPlpDivingObjChanged(SCIP_LP *lp)
SCIP_Longint nrepropcutoffs
static SCIP_RETCODE probingnodeCreate(SCIP_PROBINGNODE **probingnode, BMS_BLKMEM *blkmem, SCIP_LP *lp)
SCIP_RETCODE SCIPnodepqCreate(SCIP_NODEPQ **nodepq, SCIP_SET *set, SCIP_NODESEL *nodesel)
static SCIP_RETCODE forkCreate(SCIP_FORK **fork, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_PROB *prob, SCIP_TREE *tree, SCIP_LP *lp)
SCIP_RETCODE SCIPboundchgApply(SCIP_BOUNDCHG *boundchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, int depth, int pos, SCIP_Bool *cutoff)
SCIP_VAR * SCIPboundchgGetVar(SCIP_BOUNDCHG *boundchg)
SCIP_Bool * SCIPcliqueGetValues(SCIP_CLIQUE *clique)
SCIP_RETCODE SCIPnodeAddHolechg(SCIP_NODE *node, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_TREE *tree, SCIP_EVENTQUEUE *eventqueue, SCIP_VAR *var, SCIP_Real left, SCIP_Real right, SCIP_Bool probingchange, SCIP_Bool *added)
SCIP_BOUNDCHG * SCIPdomchgGetBoundchg(SCIP_DOMCHG *domchg, int pos)
SCIP_RETCODE SCIPtreeStartProbing(SCIP_TREE *tree, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_LP *lp, SCIP_Bool strongbranching)
#define SCIP_EVENTTYPE_NODEINFEASIBLE
SCIP_Bool SCIPsetIsRelLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
const char * SCIPnodeselGetName(SCIP_NODESEL *nodesel)
SCIP_NODE * SCIPnodepqFirst(const SCIP_NODEPQ *nodepq)
SCIP_Bool SCIPprobAllColsInLP(SCIP_PROB *prob, SCIP_SET *set, SCIP_LP *lp)
SCIP_Real SCIPvarGetObj(SCIP_VAR *var)
SCIP_RETCODE SCIPconshdlrsResetPropagationStatus(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_CONSHDLR **conshdlrs, int nconshdlrs)
SCIP_RETCODE SCIPpropagateDomains(BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_PRIMAL *primal, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_CONFLICT *conflict, SCIP_CLIQUETABLE *cliquetable, int depth, int maxproprounds, SCIP_PROPTIMING timingmask, SCIP_Bool *cutoff)
SCIP_Bool probinglpwasrelax
SCIP_Bool SCIPtreeHasCurrentNodeLP(SCIP_TREE *tree)
SCIP_RETCODE SCIPvisualUpdateChild(SCIP_VISUAL *visual, SCIP_SET *set, SCIP_STAT *stat, SCIP_NODE *node)
SCIP_RETCODE SCIPnodeCaptureLPIState(SCIP_NODE *node, int nuses)
void SCIPlpSetSizeMark(SCIP_LP *lp, int nrows, int ncols)
static SCIP_RETCODE forkFree(SCIP_FORK **fork, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_LP *lp)
void SCIPnodeGetBdChgsAfterDual(SCIP_NODE *node, SCIP_VAR **vars, SCIP_Real *varbounds, SCIP_BOUNDTYPE *varboundtypes, int start, int *nbranchvars, int branchvarssize)
SCIP_NODESEL * SCIPtreeGetNodesel(SCIP_TREE *tree)
SCIP_Real * SCIPvarGetImplBounds(SCIP_VAR *var, SCIP_Bool varfixing)
SCIP_Bool SCIPsetIsFeasLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_RETCODE SCIPlpGetNorms(SCIP_LP *lp, BMS_BLKMEM *blkmem, SCIP_LPINORMS **lpinorms)
#define SCIP_MAXTREEDEPTH
SCIP_RETCODE SCIPnodeReleaseLPIState(SCIP_NODE *node, BMS_BLKMEM *blkmem, SCIP_LP *lp)
const char * SCIPpropGetName(SCIP_PROP *prop)
SCIP_RETCODE SCIPvarGetProbvarBound(SCIP_VAR **var, SCIP_Real *bound, SCIP_BOUNDTYPE *boundtype)
SCIP_CONSSETCHG * conssetchg
SCIP_RETCODE SCIPtreeFree(SCIP_TREE **tree, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_LP *lp)
SCIP_Real SCIPnodeGetEstimate(SCIP_NODE *node)
SCIP_Real SCIPlpGetModifiedPseudoObjval(SCIP_LP *lp, SCIP_SET *set, SCIP_PROB *prob, SCIP_VAR *var, SCIP_Real oldbound, SCIP_Real newbound, SCIP_BOUNDTYPE boundtype)
enum SCIP_NodeType SCIP_NODETYPE
static SCIP_RETCODE nodeToLeaf(SCIP_NODE **node, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_NODE *lpstatefork, SCIP_Real cutoffbound)
SCIP_VAR ** SCIPvarGetImplVars(SCIP_VAR *var, SCIP_Bool varfixing)
SCIP_Real SCIPsetFeasFloor(SCIP_SET *set, SCIP_Real val)
SCIP_DOMCHGBOUND domchgbound
SCIP_RETCODE SCIPvarChgBdGlobal(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, SCIP_Real newbound, SCIP_BOUNDTYPE boundtype)
int SCIPtreeGetNSiblings(SCIP_TREE *tree)
int SCIPnodeGetNAddedConss(SCIP_NODE *node)
SCIP_Bool SCIPtreeProbingObjChanged(SCIP_TREE *tree)
SCIP_RETCODE SCIPtreeBranchVarNary(SCIP_TREE *tree, SCIP_REOPT *reopt, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_VAR *var, SCIP_Real val, int n, SCIP_Real minwidth, SCIP_Real widthfactor, int *nchildren)
static void treeNextRepropsubtreecount(SCIP_TREE *tree)
SCIP_Real SCIPnodepqGetLowerbound(SCIP_NODEPQ *nodepq, SCIP_SET *set)
SCIP_RETCODE SCIPlpSetCutoffbound(SCIP_LP *lp, SCIP_SET *set, SCIP_PROB *prob, SCIP_Real cutoffbound)
SCIP_NODE * SCIPtreeGetRootNode(SCIP_TREE *tree)
internal methods for main solving loop and node processing
SCIP_RETCODE SCIPconssetchgUndo(SCIP_CONSSETCHG *conssetchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat)
int SCIPdomchgGetNBoundchgs(SCIP_DOMCHG *domchg)
unsigned int SCIPnodeGetReoptID(SCIP_NODE *node)
static SCIP_RETCODE nodeDeactivate(SCIP_NODE *node, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_TREE *tree, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue)
SCIP_RETCODE SCIPnodeAddBoundchg(SCIP_NODE *node, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, SCIP_VAR *var, SCIP_Real newbound, SCIP_BOUNDTYPE boundtype, SCIP_Bool probingchange)
SCIP_RETCODE SCIPnodeAddHoleinfer(SCIP_NODE *node, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_TREE *tree, SCIP_EVENTQUEUE *eventqueue, SCIP_VAR *var, SCIP_Real left, SCIP_Real right, SCIP_CONS *infercons, SCIP_PROP *inferprop, int inferinfo, SCIP_Bool probingchange, SCIP_Bool *added)
SCIP_RETCODE SCIPconssetchgAddAddedCons(SCIP_CONSSETCHG **conssetchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_CONS *cons, int depth, SCIP_Bool focusnode, SCIP_Bool active)
SCIP_RETCODE SCIPtreeMarkProbingNodeHasLP(SCIP_TREE *tree, BMS_BLKMEM *blkmem, SCIP_LP *lp)
SCIP_NODE * SCIPtreeGetCurrentNode(SCIP_TREE *tree)
SCIP_RETCODE SCIPtreeBacktrackProbing(SCIP_TREE *tree, SCIP_REOPT *reopt, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_LP *lp, SCIP_RELAXATION *relaxation, SCIP_PRIMAL *primal, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_EVENTFILTER *eventfilter, SCIP_CLIQUETABLE *cliquetable, int probingdepth)
unsigned int updatedisable
public methods for message output
SCIP_Bool SCIPsetIsGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_VARSTATUS SCIPvarGetStatus(SCIP_VAR *var)
SCIP_RETCODE SCIPnodepqClear(SCIP_NODEPQ *nodepq, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_TREE *tree, SCIP_LP *lp)
static SCIP_RETCODE subrootReleaseLPIState(SCIP_SUBROOT *subroot, BMS_BLKMEM *blkmem, SCIP_LP *lp)
SCIP_RETCODE SCIPtreeFreePresolvingRoot(SCIP_TREE *tree, SCIP_REOPT *reopt, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_PRIMAL *primal, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_CONFLICT *conflict, SCIP_CONFLICTSTORE *conflictstore, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable)
SCIP_NODETYPE SCIPnodeGetType(SCIP_NODE *node)
static SCIP_RETCODE nodeCreate(SCIP_NODE **node, BMS_BLKMEM *blkmem, SCIP_SET *set)
void SCIPvisualCutoffNode(SCIP_VISUAL *visual, SCIP_SET *set, SCIP_STAT *stat, SCIP_NODE *node, SCIP_Bool infeasible)
internal methods for problem statistics
void SCIPstatUpdatePrimalDualIntegral(SCIP_STAT *stat, SCIP_SET *set, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_Real upperbound, SCIP_Real lowerbound)
SCIP_VAR ** divebdchgvars[2]
SCIP_RETCODE SCIPdomchgApply(SCIP_DOMCHG *domchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, int depth, SCIP_Bool *cutoff)
SCIP_Bool SCIPsetIsFeasPositive(SCIP_SET *set, SCIP_Real val)
SCIP_RETCODE SCIPtreeLoadProbingLPState(SCIP_TREE *tree, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, SCIP_LP *lp)
SCIP_Longint nrepropboundchgs
SCIP_RETCODE SCIPvarGetProbvarHole(SCIP_VAR **var, SCIP_Real *left, SCIP_Real *right)
#define BMSallocMemory(ptr)
#define BMSreallocMemoryArray(ptr, num)
internal methods for constraints and constraint handlers
SCIP_NODE * SCIPtreeGetPrioChild(SCIP_TREE *tree)
SCIP_Bool SCIPlpIsRelax(SCIP_LP *lp)
static SCIP_RETCODE treeApplyPendingBdchgs(SCIP_TREE *tree, SCIP_REOPT *reopt, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable)
SCIP_Bool SCIPnodeIsActive(SCIP_NODE *node)
SCIP_RETCODE SCIPnodeAddCons(SCIP_NODE *node, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_TREE *tree, SCIP_CONS *cons)
SCIP_Longint nactivatednodes
SCIP_Bool SCIPsetIsFeasGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_RETCODE SCIPnodeUpdateLowerboundLP(SCIP_NODE *node, SCIP_SET *set, SCIP_STAT *stat, SCIP_TREE *tree, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_LP *lp)
SCIP_VARTYPE SCIPvarGetType(SCIP_VAR *var)
void SCIPnodeSetReopttype(SCIP_NODE *node, SCIP_REOPTTYPE reopttype)
static SCIP_RETCODE treeNodesToQueue(SCIP_TREE *tree, SCIP_REOPT *reopt, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_LP *lp, SCIP_NODE **nodes, int *nnodes, SCIP_NODE *lpstatefork, SCIP_Real cutoffbound)
SCIP_RETCODE SCIPconssetchgMakeGlobal(SCIP_CONSSETCHG **conssetchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *prob, SCIP_REOPT *reopt)
SCIP_CLOCK * nodeactivationtime
SCIP_Real SCIPsetEpsilon(SCIP_SET *set)
SCIP_RETCODE SCIPconssetchgAddDisabledCons(SCIP_CONSSETCHG **conssetchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_CONS *cons)
SCIP_Bool probinglpwasprimfeas
SCIP_Real SCIPvarGetUbLocal(SCIP_VAR *var)
SCIP_Real SCIPtreeGetLowerbound(SCIP_TREE *tree, SCIP_SET *set)
int SCIPcliqueGetNVars(SCIP_CLIQUE *clique)
void SCIPgmlWriteOpening(FILE *file, SCIP_Bool directed)
void SCIPvarAdjustUb(SCIP_VAR *var, SCIP_SET *set, SCIP_Real *ub)
#define BMSallocBlockMemory(mem, ptr)
SCIP_RETCODE SCIPtreeCutoff(SCIP_TREE *tree, SCIP_REOPT *reopt, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_LP *lp, SCIP_Real cutoffbound)
SCIP_RETCODE SCIPlpiClearState(SCIP_LPI *lpi)
unsigned int lpwasprimfeas
SCIP_Bool SCIPeventqueueIsDelayed(SCIP_EVENTQUEUE *eventqueue)
SCIP_RETCODE SCIPprobDelVar(SCIP_PROB *prob, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, SCIP_VAR *var, SCIP_Bool *deleted)
common defines and data types used in all packages of SCIP
SCIP_Real SCIPlpGetModifiedProvedPseudoObjval(SCIP_LP *lp, SCIP_SET *set, SCIP_VAR *var, SCIP_Real oldbound, SCIP_Real newbound, SCIP_BOUNDTYPE boundtype)
void SCIPvisualMarkedRepropagateNode(SCIP_VISUAL *visual, SCIP_STAT *stat, SCIP_NODE *node)
SCIP_PENDINGBDCHG * pendingbdchgs
SCIP_Bool probingnodehaslp
struct BMS_BlkMem BMS_BLKMEM
int SCIPtreeGetNLeaves(SCIP_TREE *tree)
SCIP_RETCODE SCIPvarGetProbvarSum(SCIP_VAR **var, SCIP_SET *set, SCIP_Real *scalar, SCIP_Real *constant)
static void treeRemoveChild(SCIP_TREE *tree, SCIP_NODE *child)
SCIP_RETCODE SCIPconshdlrsStorePropagationStatus(SCIP_SET *set, SCIP_CONSHDLR **conshdlrs, int nconshdlrs)
SCIP_COL ** SCIPlpGetNewcols(SCIP_LP *lp)
SCIP_RETCODE SCIPnodePropagateImplics(SCIP_NODE *node, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, SCIP_Bool *cutoff)
static SCIP_RETCODE nodeActivate(SCIP_NODE *node, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_PRIMAL *primal, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_CONFLICT *conflict, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, SCIP_Bool *cutoff)
int SCIPtreeGetNNodes(SCIP_TREE *tree)
SCIP_Bool SCIPsetIsRelGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
static SCIP_RETCODE focusnodeToDeadend(BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_CLIQUETABLE *cliquetable)
SCIP_Longint nprobholechgs
SCIP_Bool SCIPvarIsIntegral(SCIP_VAR *var)
void SCIPchildChgNodeselPrio(SCIP_TREE *tree, SCIP_NODE *child, SCIP_Real priority)
unsigned int lpwasprimfeas
void SCIPnodeGetConsProps(SCIP_NODE *node, SCIP_VAR **vars, SCIP_Real *varbounds, SCIP_BOUNDTYPE *varboundtypes, int *nconspropvars, int conspropvarssize)
SCIP_RETCODE SCIPnodeFree(SCIP_NODE **node, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_TREE *tree, SCIP_LP *lp)
SCIP_RETCODE SCIPtreeCreateProbingNode(SCIP_TREE *tree, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_LP *lp)
void SCIPlpUnmarkDivingObjChanged(SCIP_LP *lp)
#define BMSreallocBlockMemoryArray(mem, ptr, oldnum, newnum)
SCIP_BOUNDCHG * boundchgs
SCIP_RETCODE SCIPdomchgAddBoundchg(SCIP_DOMCHG **domchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_VAR *var, SCIP_Real newbound, SCIP_BOUNDTYPE boundtype, SCIP_BOUNDCHGTYPE boundchgtype, SCIP_Real lpsolval, SCIP_VAR *infervar, SCIP_CONS *infercons, SCIP_PROP *inferprop, int inferinfo, SCIP_BOUNDTYPE inferboundtype)
static SCIP_RETCODE focusnodeToJunction(BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, SCIP_TREE *tree, SCIP_LP *lp)
void SCIPtreeMarkProbingObjChanged(SCIP_TREE *tree)
SCIP_Bool SCIPsetIsFeasNegative(SCIP_SET *set, SCIP_Real val)
SCIP_Bool probinglpwasdualfeas
SCIP_Bool SCIPvarIsActive(SCIP_VAR *var)
SCIP_NODE * SCIPtreeGetPrioSibling(SCIP_TREE *tree)