[BOOK][B] Global optimization: theory, algorithms, and applications
M Locatelli, F Schoen - 2013 - SIAM
The first systematic overviews on global optimization appeared in 1975–1978 thanks to two
fundamental volumes titled Towards Global Optimization (Dixon & Szegö, 1975, 1978). At …
fundamental volumes titled Towards Global Optimization (Dixon & Szegö, 1975, 1978). At …
The esa nlp solver worhp
C Büskens, D Wassel - Modeling and optimization in space engineering, 2013 - Springer
Abstract W e O ptimize R eally H uge P roblems (WORHP) is a solver for large-scale, sparse,
nonlinear optimization problems with millions of variables and constraints. Convexity is not …
nonlinear optimization problems with millions of variables and constraints. Convexity is not …
Iterated dynamic thresholding search for packing equal circles into a circular container
Packing equal circles in a circle is a classic global optimization problem that has a rich
research history and a number of relevant applications. The problem is computationally …
research history and a number of relevant applications. The problem is computationally …
Adaptive simulated annealing with greedy search for the circle bin packing problem
Y Yuan, K Tole, F Ni, K He, Z ** as a general and versatile optimization framework for the characterization of biological macromolecules
Since its introduction, the basin hop** (BH) framework has proven useful for hard
nonlinear optimization problems with multiple variables and modalities. Applications span a …
nonlinear optimization problems with multiple variables and modalities. Applications span a …
A configuration space evolutionary algorithm with local minimizer for weighted circles packing problem
J Liu, K Zhang, X Yan, Q Zhang - Expert Systems with Applications, 2024 - Elsevier
The weighted circles packing (WCP) problem typically aims for arranging some circular
objects into a larger rectangular (or circular) container with the constraint of non …
objects into a larger rectangular (or circular) container with the constraint of non …
Iterated dynamic neighborhood search for packing equal circles on a sphere
In this work, we investigate the equal circle packing problem on a sphere (ECPOS), which
consists in packing N equal non-overlap** circles on a unit sphere such that the radius of …
consists in packing N equal non-overlap** circles on a unit sphere such that the radius of …
A heuristic for the circle packing problem with a variety of containers
CO López, JE Beasley - European Journal of Operational Research, 2011 - Elsevier
In this paper we present a heuristic algorithm based on the formulation space search
method to solve the circle packing problem. The circle packing problem is the problem of …
method to solve the circle packing problem. The circle packing problem is the problem of …
A three-dimensional adaptive PSO-based packing algorithm for an IoT-based automated e-fulfillment packaging system
With the development of online shop** and the demand for automated packaging
systems, we propose an Internet of Things (IoT)-based automated e-fulfillment packaging …
systems, we propose an Internet of Things (IoT)-based automated e-fulfillment packaging …
Perturbation-based thresholding search for packing equal circles and spheres
This paper presents an effective perturbation-based thresholding search for two popular and
challenging packing problems with minimal containers: packing N identical circles in a …
challenging packing problems with minimal containers: packing N identical circles in a …