The following pages link to Global optimization (Q5905474):
Displaying 50 items.
- Global optimization based on novel heuristics, low-discrepancy sequences and genetic algorithms (Q1027518) (← links)
- A hybrid meta-heuristic for global optimisation using low-discrepancy sequences of points (Q1038280) (← links)
- GAS, a concept on modeling species in genetic algorithms (Q1128609) (← links)
- Stochastic techniques for global optimization: A survey of recent advances (Q1200634) (← links)
- Generalized bilinear programming: An application in farm management (Q1266521) (← links)
- Tactical design of rail freight networks. II: Local search methods with statistical analysis (Q1278269) (← links)
- A tabu search Hooke and Jeeves algorithm for unconstrained optimization (Q1280136) (← links)
- Global one-dimensional optimization using smooth auxiliary functions (Q1290603) (← links)
- A Newton-type univariate optimization algorithm for locating the nearest extremum (Q1291728) (← links)
- Asymptotics for the random coupon collector problem (Q1298487) (← links)
- Parallel computing in nonconvex programming (Q1309859) (← links)
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints (Q1310977) (← links)
- Isotropic effective energy simulated annealing searches for low energy molecular cluster states (Q1312089) (← links)
- Primal-relaxed dual global optimization approach (Q1321372) (← links)
- A parallel method for finding the global minimum of univariate functions (Q1321483) (← links)
- On the role of continuously differentiable exact penalty functions in constrained global optimization (Q1330806) (← links)
- Topographical global optimization using pre-sampled points (Q1338538) (← links)
- Topographical multilevel single linkage (Q1342898) (← links)
- An improvement on Fibonacci search method in optimization theory. (Q1412651) (← links)
- Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization. (Q1416301) (← links)
- Global optimization based on a statistical model and simplicial partitioning. (Q1416303) (← links)
- A new filled function applied to global optimization. (Q1422382) (← links)
- The barrier attribute of filled functions. (Q1426176) (← links)
- Least squares splines with free knots: Global optimization approach. (Q1426188) (← links)
- Experiments with new stochastic global optimization search techniques (Q1571032) (← links)
- A large step random walk for minimizing total weighted tardiness in a job shop (Q1579121) (← links)
- Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization (Q1595195) (← links)
- Multilayer perceptron for nonlinear programming (Q1603322) (← links)
- Asynchronously parallel optimization solver for finding multiple minima (Q1621691) (← links)
- A quantum-inspired evolutionary algorithm using Gaussian distribution-based quantization (Q1640596) (← links)
- Basin hopping networks of continuous global optimization problems (Q1642814) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space (Q1657403) (← links)
- Optimization of black-box problems using Smolyak grids and polynomial approximations (Q1668801) (← links)
- Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems (Q1713205) (← links)
- RBFOpt: an open-source library for black-box optimization with costly function evaluations (Q1741116) (← links)
- Efficient multicriterial optimization based on intensive reuse of search information (Q1754449) (← links)
- TRIOPT: A triangulation-based partitioning algorithm for global optimization (Q1763759) (← links)
- Quasi-random initial population for genetic algorithms (Q1767905) (← links)
- The application of a unified Bayesian stopping criterion in competing parallel algorithms for global optimization (Q1767963) (← links)
- Some experiments on heuristic code selection versus numerical performance in nonlinear programming (Q1804054) (← links)
- The impact of accelerating tools on the interval subdivision algorithm for global optimization (Q1804056) (← links)
- Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions. (Q1810523) (← links)
- The impelling function method applied to global optimization (Q1827019) (← links)
- A computable filled function used for global minimization (Q1855165) (← links)
- Several filled functions with mitigators. (Q1855890) (← links)
- A stochastic approach to global optimization of nonlinear programming problem with many equality constraints (Q1883156) (← links)
- Population set-based global optimization algorithms: some modifications and numerical studies (Q1885971) (← links)
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives (Q1904655) (← links)
- An adaptive stochastic global optimization algorithm for one-dimensional functions (Q1904720) (← links)
