Abstract
Dual-feasible functions have been designed specifically for the cutting-stock problem. As shown in Chap. 1, they arise naturally from the dual of the classical formulation of Gilmore and Gomory for this problem. Since many problems can be modeled using a similar formulation, it makes sense to explore the concept of dual-feasible function within a more general class of applications. A first approach is to considermulti-dimensional dual-feasible functions,which can be used to derive lower bounds for the vector packing problem. Here, we also consider different packing problems with more complicated subproblems such as multi-dimensional orthogonal packing and packing with conflicts. Dual-feasible functions can still be derived in these cases.
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.
