This paper deals with the packing problem of circles and non-convex polygons, which can be both translated and rotated into a strip with prohibited regions. Using the Ф-function technique, a ...

The Difference of Convex functions Algorithm (DCA) is used to solve nonconvex optimization problems over a certain convex set, specifically quadratic programming ones, generally by finding approximate ...

If a microscope is defined as an instrument that enables the visualization of objects or structures that are usually invisible to the naked eye, then microscopes appeared at the end of the sixteenth ...