The following pages link to (Q4833803):
Displaying 18 items.
- The robust constant and its applications in random global search for unconstrained global optimization (Q280976) (← links)
- Properties and numerical testing of a parallel global optimization algorithm (Q715140) (← links)
- 2U: an exact interval propagation algorithm for polytrees with binary variables (Q1275598) (← links)
- A MIQCP formulation for B-spline constraints (Q1653267) (← links)
- On the convergence rate issues of general Markov search for global minimum (Q1685583) (← links)
- Approximation algorithm for a class of global optimization problems (Q1937958) (← links)
- Global optimization problems and domain reduction strategies (Q1960192) (← links)
- An adaptive procedure for the global minimization of a class of polynomial functions (Q2004881) (← links)
- Hybrid control for tracking environmental level sets by nonholonomic robots in maze-like environments (Q2061236) (← links)
- Quantitative measure of nonconvexity for black-box continuous functions (Q2201645) (← links)
- Dynamic search trajectory methods for global optimization (Q2294590) (← links)
- The Robust Constant and Its Applications in Global Optimization (Q2942507) (← links)
- On the Asymptotic Tractability of Global Optimization (Q2958611) (← links)
- Studies of multi-start clustering for global optimization (Q4530125) (← links)
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (Q4637831) (← links)
- Conflict Analysis for MINLP (Q4995080) (← links)
- A Lipschitz Matrix for Parameter Reduction in Computational Science (Q4997385) (← links)
- Constrained, Global Optimization of Unknown Functions with Lipschitz Continuous Gradients (Q5081778) (← links)
