Searched refs:bestbound (Results 1 – 7 of 7) sorted by relevance
/dports/math/concorde/concorde/HELDKARP/ |
H A D | heldkarp.c | 349 int bestbound = -INT_MAX; in held_karp_bound() local 367 if (tlen > bestbound) bestbound = tlen; in held_karp_bound() 407 *val = (bestbound >> WEIGHT_ADJUST); in held_karp_bound() 408 if (bestbound % WEIGHT_MULT) (*val)++; in held_karp_bound()
|
/dports/math/SCIP/scip-7.0.3/src/scip/ |
H A D | pricestore.c | 327 SCIP_Real bestbound; in addBoundViolated() local 330 bestbound = SCIPvarGetBestBoundLocal(var); in addBoundViolated() 331 if( !SCIPsetIsZero(set, bestbound) ) in addBoundViolated() 334 SCIPvarGetName(var), SCIPvarGetLbLocal(var), SCIPvarGetUbLocal(var), bestbound); in addBoundViolated() 336 -SCIPvarGetObj(var) * bestbound, (SCIPtreeGetCurrentDepth(tree) == 0)) ); in addBoundViolated()
|
H A D | heur_twoopt.c | 968 SCIP_Real bestbound; in optimize() local 1008 bestbound = 0.0; in optimize() 1144 bestbound = equaldirbound; in optimize() 1146 bestbound = diffdirbound; in optimize() 1165 …t)bestslavedir * SCIPvarGetObj(bestslaves[npairs]) + (int)bestmasterdir * masterobj) * bestbound; in optimize() 1172 … SCIPvarGetObj(bestslaves[npairs]), mastersolval + (int)bestmasterdir * bestbound, SCIPgetSolVal(s… in optimize() 1173 + (int)bestslavedir * bestbound, bestdirections[npairs]); in optimize()
|
H A D | heur_alns.c | 1247 SCIP_Real bestbound; in getVariableRedcostScore() local 1261 bestbound = SCIPvarGetBestRootSol(var); in getVariableRedcostScore() 1265 … || (SCIPisDualfeasNegative(scip, redcost) && ! SCIPisFeasPositive(scip, refsolval - bestbound)) in getVariableRedcostScore() 1266 … || (SCIPisDualfeasPositive(scip, redcost) && ! SCIPisFeasNegative(scip, refsolval - bestbound))); in getVariableRedcostScore() 1276 bestbound = SCIPvarGetLPSol(var); in getVariableRedcostScore() 1279 assert(! SCIPisInfinity(scip, REALABS(bestbound))); in getVariableRedcostScore() 1280 assert(SCIPisDualfeasZero(scip, redcost) || SCIPisFeasIntegral(scip, bestbound)); in getVariableRedcostScore() 1282 score = redcost * (refsolval - bestbound); in getVariableRedcostScore()
|
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/TSP/ |
H A D | bcontrol.c | 334 double bestbound = CCtsp_LP_MAXDOUBLE; local 352 if (b->workstatus == BB_IDLE && b->lowerbound < bestbound) { 353 bestbound = b->lowerbound; 365 bestbbnode->id, bestbound);
|
/dports/math/concorde/concorde/TSP/ |
H A D | bcontrol.c | 2840 double bestbound = CCtsp_LP_MAXDOUBLE; in select_bbnode() local 2863 if (b->workstatus == BB_IDLE && b->lowerbound < bestbound) { in select_bbnode() 2869 bestbound = b->lowerbound; in select_bbnode() 2874 bestbound = b->lowerbound; in select_bbnode() 2880 bestbound = b->lowerbound; in select_bbnode() 2892 bestbbnode->id, bestbound); in select_bbnode()
|
/dports/math/py-Pyomo/Pyomo-6.1.2/pyomo/solvers/plugins/solvers/ |
H A D | xpress_direct.py | 641 self.results.problem.lower_bound = xprob_attrs.bestbound 646 self.results.problem.upper_bound = xprob_attrs.bestbound
|