The method of artificial space dilation in problems of optimal packing of geometric objects
From MaRDI portal
Publication:681723
DOI10.1007/s10559-017-9974-yzbMath1392.90099OpenAlexW2759307277MaRDI QIDQ681723
Publication date: 13 February 2018
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-017-9974-y
Combinatorial optimization (90C27) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items (9)
Two approaches to modeling and solving the packing problem for convex polytopes ⋮ Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem ⋮ Configuration space of geometric objects ⋮ Theory and methods of Euclidian combinatorial optimization: current status and prospects ⋮ \( \Phi \)-functions of 2D objects with boundaries being second-order curves ⋮ Optimized packing multidimensional hyperspheres: a unified approach ⋮ Properties of combinatorial optimization problems over polyhedral-spherical sets ⋮ Unnamed Item ⋮ Formalizing spatial configuration optimization problems with the use of a special function class
Cites Work
- Unnamed Item
- Unnamed Item
- Quasi-phi-functions and optimal packing of ellipses
- On the global minimum in a balanced circular packing problem
- Packing unequal spheres into various containers
- Packing unit spheres into the smallest sphere using VNS and NLP
- Continuous representations and functional extensions in combinatorial optimization
- Formalization and solution of one class of covering problems for the design of monitoring and testing systems
- Set coverings and tolerance relations
- On a set of problems on covering of a bounded set
- Localization of solutions of some problems of nonlinear integer optimization
- The theory of convex continuations of functions at the vertices of convex polygons
- Optimal clustering of a pair of irregular objects
- Mathematical model and efficient algorithms for object packing problem
- Optimized packings with applications
- Constraints in container loading -- a state-of-the-art review
- Packing unequal circles into a strip of minimal length with a jump algorithm
- Continuous Approaches to the Unconstrained Binary Quadratic Problems
- Bounds on the minimum of convex functions on Euclidean combinatorial sets
This page was built for publication: The method of artificial space dilation in problems of optimal packing of geometric objects
