Abstract
This chapter focuses on the famous cutting stock/bin packing problem which was the first problem to be modeled by column generation. The compact equivalent counterpart of this problem has a very interesting structure of a particular flow problem. Two other packing problems for which we may show compact extended formulations are the robust knapsack problem and the cycle packing problem. For the former problem we show, by using LP techniques, that of two different formulations appeared in the literature one is indeed the compact extended formulation of the other.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Lancia, G., Serafini, P. (2018). Packing. In: Compact Extended Linear Programming Models. EURO Advanced Tutorials on Operational Research. Springer, Cham. https://doi.org/10.1007/978-3-319-63976-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-63976-5_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-63975-8
Online ISBN: 978-3-319-63976-5
eBook Packages: Business and ManagementBusiness and Management (R0)