Abstract
We consider a two-dimensional vector packing problem in which each item has size in x- and y-coordinates. The purpose of this paper is to provide a ground work on how hard two-dimensional vector packing problems are for large items. We prove that the problem with each item greater than 1/2-e either in x- or y-coordinates for 0 < e ≤ 1/6 has no APTAS unless P = NP.
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 callMore From: Journal of Korean Institute of Industrial Engineers
Disclaimer: 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.
