Year-end Sale % OFF 
Abstract
The problem of the layout of objects of different sizes is analyzed. The objective function is shown to depend on several variables, which are various combinatorial configurations. According to this principle, the problem is divided into several subproblems; therefore, a self-adjusting algorithm is developed to solve it. A location problem for objects of the same size is solved by the structural-alphabetic search, which is based on the known solvable case.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
