The concept of modeling packing and covering problems using modern computational geometry software

DOI10.1007/S10559-023-00547-5MaRDI QIDQ6160558zbMATH OpenOpenAlexFDO

Authors Sergey Yakovlev

Publication date 10 May 2023

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-023-00547-5

zbMATH Keywords

computational geometry softwaremathematical modelingoptimizationpacking and covering problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Modeling close packing of 3D objects
• Tools of mathematical modeling of arbitrary object packing problems
• A mathematical model and a method of solution the packing optimization problem for arbitrary 2D objects in rectangular domains
• scientific article; zbMATH DE number 5520539
• New approaches to circle packing in a square. With program codes.

Cites work

• \(\Phi\)-functions for complex 2D-objects
• A nonlinear programming model with implicit variables for packing ellipsoids
• Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
• Configuration space of geometric objects
• Continuous maximal covering location problems with interconnected facilities
• Covering a polygonal region by rectangles
• Cutting ellipses from area-minimizing rectangles
• Formalization and solution of one class of covering problems for the design of monitoring and testing systems
• Formalizing spatial configuration optimization problems with the use of a special function class
• Handbook of heuristics
• scientific article; zbMATH DE number 3825109 (Why is no real title available?)
• scientific article; zbMATH DE number 3896655 (Why is no real title available?)
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 3282420 (Why is no real title available?)
• scientific article; zbMATH DE number 3360173 (Why is no real title available?)
• Location covering models. History, applications and advancements
• Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
• Mathematical modeling of distance constraints on two-dimensional \(\varphi\)-objects
• Mathematical modeling of interactions of primary geometric 3D objects
• Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
• Metaheuristic downhill simplex method in combinatorial optimization
• Modeling and optimization in space engineering. State of the art and new challenges
• On a set of problems on covering of a bounded set
• Optimized object packings using quasi-phi-functions
• Packing circular-like objects in a rectangular container
• Packing convex 3D objects with special geometric and balancing conditions
• Packing ellipses in an optimized convex polygon
• Packing ellipsoids by nonlinear optimization
• Parallel computing technologies for solving optimization problems of geometric design
• Placement problems for irregular objects: mathematical modeling, optimization and applications
• Planar maximum coverage location problem with partial coverage and rectangular demand and service zones
• Sparse balanced layout of ellipsoids
• The covering of non-convex polytope by a finite family of right parallelepipeds
• Tools of mathematical modeling of arbitrary object packing problems

This page was built for publication: The concept of modeling packing and covering problems using modern computational geometry software

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160558)