Abstract
Abstract A problem of rectangular packing in a semi-infinite strip is considered in the article. For designing admissible packings the algorithm next fit (NF) is used with search of the best decisions in L -vicinity, where- L is a bottom border. It can be found by solving the problem of one-dimensional cutting with additional restrictions. For search of the best decision the updating of the algorithm (0–1)-knapsack is offered.
Sign-in/Register to access full text options 
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.
