Home
last modified time | relevance | path

Searched refs:lowerbound (Results 1 – 25 of 431) sorted by relevance

12345678910>>...18

/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/TSP/
H A Dbcontrol.c35 double lowerbound; member
100 bbnode->lowerbound = 0.0;
120 double lowerbound;
152 rootbbnode->lowerbound = lowerbound;
283 child->lowerbound = val0;
341 if (b->lowerbound < lowerbound) {
342 lowerbound = b->lowerbound;
455 lp->lowerbound = bnd;
524 oldbound = lp->lowerbound;
589 lp->lowerbound = oldbound;
[all …]
/dports/math/SCIP/scip-7.0.3/src/scip/
H A Dvisual.c267 SCIP_Real lowerbound; in SCIPvisualNewChild() local
305 lowerbound = SCIPnodeGetLowerbound(node); in SCIPvisualNewChild()
342 SCIP_Real lowerbound; in SCIPvisualUpdateChild() local
368 lowerbound = SCIPnodeGetLowerbound(node); in SCIPvisualUpdateChild()
432 lowerbound, sum, nlpcands); in SCIPvisualUpdateChild()
474 SCIP_Real lowerbound; in SCIPvisualSolvedNode() local
500 lowerbound = SCIPnodeGetLowerbound(node); in SCIPvisualSolvedNode()
535 SCIP_Real lowerbound; in SCIPvisualCutoffNode() local
777 …if ( ! SCIPsetIsInfinity(set, lowerbound) && SCIPsetIsGT(set, lowerbound, visual->lastlowerbound) ) in SCIPvisualLowerbound()
779 visual->lastlowerbound = lowerbound; in SCIPvisualLowerbound()
[all …]
H A Dnodesel_bfs.c167 SCIP_Real lowerbound; in SCIP_DECL_NODESELSELECT() local
170 lowerbound = SCIPgetLowerbound(scip); in SCIP_DECL_NODESELSELECT()
177 cutoffbound = lowerbound + 0.2 * (cutoffbound - lowerbound); in SCIP_DECL_NODESELSELECT()
179 maxbound = lowerbound + maxplungequot * (cutoffbound - lowerbound); in SCIP_DECL_NODESELSELECT()
182 … minplungedepth, maxplungedepth, plungedepth, lowerbound, cutoffbound, maxbound); in SCIP_DECL_NODESELSELECT()
H A Dnodesel_hybridestim.c180 SCIP_Real lowerbound; in SCIP_DECL_NODESELSELECT() local
185 lowerbound = SCIPgetLowerbound(scip); in SCIP_DECL_NODESELSELECT()
192 cutoffbound = lowerbound + 0.2 * (cutoffbound - lowerbound); in SCIP_DECL_NODESELSELECT()
200 maxbound = lowerbound + maxplungequot * (cutoffbound - lowerbound); in SCIP_DECL_NODESELSELECT()
204 minplungedepth, maxplungedepth, plungedepth, lowerbound, cutoffbound, maxbound); in SCIP_DECL_NODESELSELECT()
H A Dheur_zirounding.c127 assert(lowerbound != NULL); in calculateBounds()
149 *lowerbound = SCIPinfinity(scip); in calculateBounds()
151 *lowerbound = currentvalue - SCIPvarGetLbGlobal(var); in calculateBounds()
184 *lowerbound, *upperbound); in calculateBounds()
202 *lowerbound = MIN(*lowerbound, downslack/colvals[i]); in calculateBounds()
213 *lowerbound = MIN(*lowerbound, -upslack/colvals[i]); in calculateBounds()
735 SCIP_Real lowerbound; in SCIP_DECL_HEUREXEC() local
754 lowerbound = SCIPinfinity(scip); in SCIP_DECL_HEUREXEC()
761 if( MAX(upperbound, lowerbound) < MINSHIFT ) in SCIP_DECL_HEUREXEC()
772 down = oldsolval - lowerbound; in SCIP_DECL_HEUREXEC()
[all …]
H A Dnodesel_estimate.c206 SCIP_Real lowerbound; in SCIP_DECL_NODESELSELECT() local
211 lowerbound = SCIPgetLowerbound(scip); in SCIP_DECL_NODESELSELECT()
218 cutoffbound = lowerbound + 0.2 * (cutoffbound - lowerbound); in SCIP_DECL_NODESELSELECT()
226 maxbound = lowerbound + maxplungequot * (cutoffbound - lowerbound); in SCIP_DECL_NODESELSELECT()
230 minplungedepth, maxplungedepth, plungedepth, lowerbound, cutoffbound, maxbound); in SCIP_DECL_NODESELSELECT()
/dports/math/universal/universal-3.48/include/universal/blas/generators/
H A Duniform_random.hpp14 Matrix uniform_random(size_t M, size_t N, double lowerbound = 0.0, double upperbound = 1.0) { in uniform_random() argument
16 return uniform_random(A, lowerbound, upperbound); in uniform_random()
21 vector<Scalar>& uniform_random(vector<Scalar>& v, double lowerbound = 0.0, double upperbound = 1.0) in uniform_random() argument
30 std::uniform_real_distribution<double> dist{ lowerbound, upperbound }; in uniform_random()
43 matrix<Scalar>& uniform_random(matrix<Scalar>& A, double lowerbound = 0.0, double upperbound = 1.0) in uniform_random() argument
52 std::uniform_real_distribution<double> dist{ lowerbound, upperbound }; in uniform_random()
/dports/math/openturns/openturns-1.18/python/doc/examples/numerical_methods/optimization/
H A Dplot_optimization_rastrigin.py64 lowerbound = [-4.4] * dim variable
66 bounds = ot.Interval(lowerbound, upperbound)
73 graph = rastrigin.draw(lowerbound, upperbound, [100]*dim)
95 [ot.Uniform(lowerbound[0], upperbound[0])] * dim)
106 graph = rastrigin.draw(lowerbound, upperbound, [100]*dim)
151 graph = rastrigin.draw(lowerbound, upperbound, [100]*dim)
177 graph = rastrigin.draw(lowerbound, upperbound, [100]*dim)
H A Dplot_ego.py53 lowerbound = [-4.0] * dim variable
66 graph = model.draw(lowerbound, upperbound, [100]*dim)
81 lowerbound[i], upperbound[i]) for i in range(dim)]
114 bounds = ot.Interval(lowerbound, upperbound)
151 graph = model.draw(lowerbound, upperbound, [100]*dim)
206 lowerbound = bm.lowerbound variable
224 graph = objectiveFunction.draw(lowerbound, upperbound, [100]*dim)
269 bounds = ot.Interval(lowerbound, upperbound)
302 graph = objectiveFunction.draw(lowerbound, upperbound, [100]*dim)
H A Dplot_optimization_rosenbrock.py49 lowerbound = [-2.0, -2.0] variable
60 graph = rosenbrock.draw(lowerbound, upperbound, [100]*2)
103 graph = rosenbrock.draw(lowerbound, upperbound, [100]*2)
128 graph = rosenbrock.draw(lowerbound, upperbound, [100]*2)
144 bounds = ot.Interval(lowerbound, upperbound)
183 graph = rosenbrock.draw(lowerbound, upperbound, [100]*2)
/dports/math/py-iohexperimenter/IOHexperimenter-0.2.9.2/src/
H A DIOHprofiler_problem.hpp145 return this->lowerbound; in IOHprofiler_get_lowerbound()
148 …<class InputType> void IOHprofiler_problem<InputType>::IOHprofiler_set_lowerbound(int lowerbound) { in IOHprofiler_set_lowerbound() argument
149 std::vector<InputType>().swap(this->lowerbound); in IOHprofiler_set_lowerbound()
150 this->lowerbound.reserve(this->number_of_variables); in IOHprofiler_set_lowerbound()
152 this->lowerbound.push_back(lowerbound); in IOHprofiler_set_lowerbound()
156 …profiler_problem<InputType>::IOHprofiler_set_lowerbound(const std::vector<InputType> &lowerbound) { in IOHprofiler_set_lowerbound() argument
157 this->lowerbound = lowerbound; in IOHprofiler_set_lowerbound()
185 if (this->lowerbound.size() != 0) { in IOHprofiler_set_number_of_variables()
186 this->IOHprofiler_set_lowerbound(this->lowerbound[0]); in IOHprofiler_set_number_of_variables()
198 if (this->lowerbound.size() != 0) { in IOHprofiler_set_number_of_variables()
[all …]
/dports/x11-toolkits/py-easygui/easygui-0.98.1/easygui/boxes/
H A Dderived_boxes.py254 lowerbound=0, upperbound=99, image=None, root=None): argument
286 lowerbound, upperbound)
291 lowerbound = convert_to_type(lowerbound, int, "lowerbound")
303 if lowerbound is not None:
304 if reply < lowerbound:
305 …sgbox('The value that you entered is less than the lower bound of {}.'.format(lowerbound), "Error")
/dports/lang/fpc-source/fpc-3.2.2/tests/test/cg/
H A Dtfor.pp75 { lowerbound : constant }
93 { lowerbound : LOC_REFERENCE }
115 { lowerbound : LOC_REGISTER }
166 { lowerbound : LOC_REFERENCE }
188 { lowerbound : LOC_REGISTER }
239 { lowerbound : LOC_REFERENCE }
262 { lowerbound : LOC_REGISTER }
312 { lowerbound : LOC_REFERENCE }
334 { lowerbound : LOC_REGISTER }
385 { lowerbound : LOC_REFERENCE }
[all …]
/dports/math/flopc++/FlopCpp-d4c1d98/FlopCpp/examples/
H A Dstochbenders.cpp90 double lowerbound = -masterproblem->getInfinity(); in main() local
118 cout<<"Lower and upper bounds: "<<lowerbound<<" "<<upperbound<<endl; in main()
119 if ((upperbound-lowerbound) < 0.0001*(1+fabs(lowerbound))) { in main()
129 lowerbound = masterproblem->getObjValue(); in main()
130 objmaster = lowerbound - theta.level(); in main()
/dports/science/nest/nest-simulator-3.1/models/
H A Dcont_delay_synapse_impl.h85 const long lowerbound = static_cast< long >( int_delay ); in set_status() local
86 …connection_manager.get_delay_checker().assert_two_valid_delays_steps( lowerbound, lowerbound + 1 ); in set_status()
87 set_delay_steps( lowerbound + 1 ); in set_status()
/dports/math/concorde/concorde/TOOLS/
H A Dshowres.c50 double lowerbound; member
210 bbnode->child0->lowerbound <= upbound - 1.0) { in number_tree()
217 bbnode->child1->lowerbound <= upbound - 1.0) { in number_tree()
345 bto->number, bto->lowerbound); in draw_edge()
353 bbnode->child0->lowerbound <= upbound - 1.0) { in draw_subtree_edges()
359 bbnode->child1->lowerbound <= upbound - 1.0) { in draw_subtree_edges()
461 double v = bbnode->lowerbound; in print_node()
531 double v = bbnode->lowerbound; in output_tree()
753 bbnode->lowerbound < *lower) { in collect_leaves()
754 *lower = bbnode->lowerbound; in collect_leaves()
[all …]
/dports/biology/migrate/migrate-3.6.11/src/
H A Dhistogram.c137 lowerbound[i] = options->bayespriortheta->min; in get_fullbinsum()
143 lowerbound[i] = options->bayespriorm->min; in get_fullbinsum()
149 lowerbound[i] = options->bayespriorrate->min; in get_fullbinsum()
189 MYREAL *lowerbound; in read_bayes_fromfile() local
211 lowerbound = (MYREAL *) mycalloc(nn, sizeof(MYREAL)); in read_bayes_fromfile()
295 bayes->histogram[locus].binsum = get_fullbinsum(lowerbound, upperbound, world, options, locus); in read_bayes_fromfile()
350 bin = (long) ((params[j+2]-lowerbound[j]) / delta[j]); in read_bayes_fromfile()
352 hist->minima[j0] = lowerbound[j]; in read_bayes_fromfile()
364 bin = (long) ((params[j0+2]-lowerbound[j0]) / delta[j0]); in read_bayes_fromfile()
365 hist->minima[j0] = lowerbound[j0]; in read_bayes_fromfile()
[all …]
/dports/misc/openmvg/openMVG-2.0/src/openMVG/cameras/
H A DCamera_Pinhole_Radial.hpp46 double lowerbound = r2, upbound = r2; in bisection_Radius_Solve() local
47 while ( functor( params, lowerbound ) > r2 ) in bisection_Radius_Solve()
49 lowerbound /= 1.05; in bisection_Radius_Solve()
57 while ( epsilon < upbound - lowerbound ) in bisection_Radius_Solve()
59 const double mid = .5 * ( lowerbound + upbound ); in bisection_Radius_Solve()
66 lowerbound = mid; in bisection_Radius_Solve()
69 return .5 * ( lowerbound + upbound ); in bisection_Radius_Solve()
/dports/math/py-iohexperimenter/IOHexperimenter-0.2.9.2/tests/
H A Dtest_IOH_function.py16 assert all(f.lowerbound == 0)
26 assert all(f.lowerbound == -5)
38 assert all(f.lowerbound == -5)
70 x = np.random.uniform(func.lowerbound, func.upperbound)
/dports/math/SCIP/scip-7.0.3/applications/STP/src/
H A Dpricer_stp.c49 SCIP_Real lowerbound; /**< lower bound computed by the pricer */ member
121 pricerdata->lowerbound = 0; in SCIP_DECL_PRICERINIT()
179 SCIP_Real* lowerbound, /**< lowerbound pointer */ in pricing() argument
216 if ( pricerdata->lowerbound <= 4 ) in pricing()
219 (void)SCIPsnprintf(label, SCIP_MAXSTRLEN, "X%g.gml", pricerdata->lowerbound); in pricing()
221 pricerdata->lowerbound++; in pricing()
346 *lowerbound = newlowerbound; in pricing()
358 SCIP_CALL( pricing(scip, pricer, lowerbound, FALSE) ); in SCIP_DECL_PRICERREDCOST()
/dports/math/SCIP/scip-7.0.3/tests/src/bugs/
H A Dlowerbound.c48 assert( lowerbound != NULL ); in SCIP_DECL_RELAXEXEC()
54 *lowerbound = SIZE/2 + 1; in SCIP_DECL_RELAXEXEC()
64 *lowerbound = SIZE/2; in SCIP_DECL_RELAXEXEC()
95 Test(lowerbound, constant, .signal = SIGABRT)
/dports/www/elixir-phoenix_pubsub/phoenix_pubsub-1.0.2/test/phoenix/tracker/
H A Dclock_test.exs38 test "lowerbound" do test
39 assert Clock.lowerbound(%{a: 1, b: 2, c: 2}, %{a: 3, b: 1, d: 2}) ==
42 assert Clock.lowerbound(%{}, %{a: 3, b: 1, d: 2}) == %{a: 3, b: 1, d: 2}
43 assert Clock.lowerbound(%{a: 3, b: 1, d: 2}, %{}) == %{a: 3, b: 1, d: 2}
/dports/biology/py-bx-python/bx-python-0.8.13/lib/bx/intervals/operations/
H A Djoin.py121 lowerbound = x
123 while (lowerbound > -1) and (findoverlap(sortedlist[lowerbound-1][0], interval) >= mincols):
124 lowerbound -= 1
128 return lowerbound, upperbound
/dports/math/py-iohexperimenter/IOHexperimenter-0.2.9.2/IOHexperimenter/
H A DIOH_function.py99 self.oob += any(x < self.lowerbound) or any(x > self.upperbound)
193 def lowerbound(self): member in IOH_function
278 lowerbound=-5): argument
316 if isinstance(lowerbound, Iterable) and len(lowerbound) == dim:
317 self.lb = np.array(lowerbound)
319 self.lb = np.array(dim * [lowerbound])
358 def lowerbound(self): member in custom_IOH_function
/dports/devel/gdb/gdb-11.1/gdb/
H A Df-array-walker.h200 LONGEST lowerbound, upperbound; in walk_1() local
201 if (!get_discrete_bounds (range_type, &lowerbound, &upperbound)) in walk_1()
214 for (LONGEST i = lowerbound; in walk_1()
231 for (LONGEST i = lowerbound; in walk_1()

12345678910>>...18