Home
last modified time | relevance | path

Searched refs:edgearrint (Results 1 – 10 of 10) sorted by relevance

/dports/math/SCIP/scip-7.0.3/applications/STP/src/
H A Dheur_prune.c133 int* edgearrint, /**< array */ in computeNewSols() argument
487 int* edgearrint, /**< array */ in SCIPStpHeurPruneUpdateSols() argument
509 assert(edgearrint != NULL); in SCIPStpHeurPruneUpdateSols()
555 assert(graph_sol_valid(scip, g, edgearrint)); in SCIPStpHeurPruneUpdateSols()
558 if( !graph_sol_valid(scip, g, edgearrint) ) in SCIPStpHeurPruneUpdateSols()
565 objnew = graph_sol_getObj(g->cost, edgearrint, 0.0, nedges); in SCIPStpHeurPruneUpdateSols()
576 objnew = graph_sol_getObj(g->cost, edgearrint, 0.0, nedges); in SCIPStpHeurPruneUpdateSols()
583 BMScopyMemoryArray(globalsoledge, edgearrint, nedges); in SCIPStpHeurPruneUpdateSols()
632 int* edgearrint; in SCIPStpHeurPruneRun() local
669 SCIP_CALL( SCIPallocBufferArray(scip, &edgearrint, nedges) ); in SCIPStpHeurPruneRun()
[all …]
H A Dreduce.c78 int* edgearrint, in nvreduce_sl() argument
244 int* edgearrint; in reduceStp() local
324 SCIPfreeBufferArray(scip, &edgearrint); in reduceStp()
359 int* edgearrint; in reducePc() local
441 SCIPfreeBufferArray(scip, &edgearrint); in reducePc()
477 int* edgearrint; in reduceMw() local
515 edgearrint = NULL; in reduceMw()
711 int* edgearrint; in reduceSap() local
812 SCIPfreeBufferArray(scip, &edgearrint); in reduceSap()
845 int* edgearrint; in reduceNw() local
[all …]
H A Dheur_ascendprune.c162 int* edgearrint; in SCIP_DECL_HEUREXEC() local
218 SCIP_CALL( SCIPallocBufferArray(scip, &edgearrint, nedges) ); in SCIP_DECL_HEUREXEC()
260 …SCIP_CALL( SCIPStpHeurAscendPruneRun(scip, heur, graph, redcosts, edgearrint, nodearrint, graph->s… in SCIP_DECL_HEUREXEC()
277 SCIPfreeBufferArray(scip, &edgearrint); in SCIP_DECL_HEUREXEC()
295 int* edgearrint, /**< int edges array to store solution */ in SCIPStpHeurAscendPruneRun() argument
306 int* const newedges = edgearrint; in SCIPStpHeurAscendPruneRun()
320 assert(edgearrint != NULL); in SCIPStpHeurAscendPruneRun()
H A Dheur_slackprune.c836 int* edgearrint; in SCIPStpHeurSlackPruneRunPcMw() local
899 edgearrint = soledge; in SCIPStpHeurSlackPruneRunPcMw()
946 edgearrint, nodearrint2, solnode, nodearrchar, &danelims, minnelims, ((i == 0))) ); in SCIPStpHeurSlackPruneRunPcMw()
948 updateSolNodeArray(prunegraph, edgearrint, solnode, nprunenodes, npruneedges); in SCIPStpHeurSlackPruneRunPcMw()
951 obj = graph_sol_getObj(prunegraph->cost, edgearrint, offsetnew, npruneedges); in SCIPStpHeurSlackPruneRunPcMw()
982 …SCIP_CALL( SCIPStpHeurAscendPruneRun(scip, NULL, prunegraph, cost, edgearrint, vbase, -1, nodearrc… in SCIPStpHeurSlackPruneRunPcMw()
988 obj = graph_sol_getObj(prunegraph->cost, edgearrint, offsetnew, npruneedges); in SCIPStpHeurSlackPruneRunPcMw()
995 updateSolNodeArray(prunegraph, edgearrint, solnode, nprunenodes, npruneedges); in SCIPStpHeurSlackPruneRunPcMw()
H A Dheur_ascendprune.h51 int* edgearrint, /**< int edges array to store solution */
H A Dheur_prune.h45 int* edgearrint, /**< array */
H A Dcons_stp.h73 …int* RESTRICT edgearrint, /**< int edges array for internal computations or NULL */
H A Dreduce_bnd.c3342 assert(edgearrint != NULL); in reduce_daSlackPrune()
3416 edgearrint[e] = UNKNOWN; in reduce_daSlackPrune()
3425 edgearrint[e] = CONNECT; in reduce_daSlackPrune()
3448 if( edgearrint[e] == CONNECT ) in reduce_daSlackPrune()
3543 edgearrint[e] = edgearrint2[e]; in reduce_daSlackPrune()
3544 if( edgearrint[e] == CONNECT ) in reduce_daSlackPrune()
3556 if( edgearrint[e] == CONNECT ) in reduce_daSlackPrune()
3687 || (edgearrint[e] == CONNECT) || (edgearrint[flipedge(e)] == CONNECT) ) in reduce_daSlackPrune()
3865 if( edgearrint == NULL ) in reduce_daPcMw()
3868 result = edgearrint; in reduce_daPcMw()
[all …]
H A Dcons_stp.c1696 …int* RESTRICT edgearrint, /**< int edges array for internal computations or NULL */ argument
1781 if( edgearrint == NULL )
1784 unsatarcs = edgearrint;
2252 if( edgearrint == NULL )
H A Dreduce_alt.c3715 int* edgearrint, /**< edge int array for internal computations */ in reduce_nv() argument
3809 …SCIP_CALL( graph_voronoiWithDist(scip, g, g->cost, distance, edgearrint, vbase, minedge1, heap, st… in reduce_nv()
3909 int* edgearrint, /**< edges-sized array */ in reduce_nvAdv() argument
4010 …SCIP_CALL( graph_voronoiWithDist(scip, g, g->cost, distance, edgearrint, vbase, minedge1, heap, st… in reduce_nvAdv()