IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v183y2007i3p1333-1352.html
   My bibliography  Save this article

Accelerating column generation for variable sized bin-packing problems

Author

Listed:
  • Alves, Claudio
  • Valerio de Carvalho, J.M.

Abstract

No abstract is available for this item.

Suggested Citation

  • Alves, Claudio & Valerio de Carvalho, J.M., 2007. "Accelerating column generation for variable sized bin-packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1333-1352, December.
    • Handle: RePEc:eee:ejores:v:183:y:2007:i:3:p:1333-1352
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00308-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Valerio de Carvalho, J. M., 2002. "LP models for bin packing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 141(2), pages 253-273, September.
    2. P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    3. Belov, G. & Scheithauer, G., 2002. "A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths," European Journal of Operational Research, Elsevier, vol. 141(2), pages 274-294, September.
    4. P. C. Gilmore & R. E. Gomory, 1963. "A Linear Programming Approach to the Cutting Stock Problem---Part II," Operations Research, INFORMS, vol. 11(6), pages 863-888, December.
    5. Dyckhoff, Harald, 1990. "A typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 44(2), pages 145-159, January.
    6. Holthaus, Oliver, 2002. "Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths," European Journal of Operational Research, Elsevier, vol. 141(2), pages 295-312, September.
    7. David F. Rogers & Robert D. Plante & Richard T. Wong & James R. Evans, 1991. "Aggregation and Disaggregation Techniques and Methodology in Optimization," Operations Research, INFORMS, vol. 39(4), pages 553-582, August.
    8. Zeger Degraeve & Marc Peeters, 2003. "Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results," INFORMS Journal on Computing, INFORMS, vol. 15(1), pages 58-81, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mauro Baldi & Teodor Crainic & Guido Perboli & Roberto Tadei, 2014. "Branch-and-price and beam search algorithms for the Variable Cost and Size Bin Packing Problem with optional items," Annals of Operations Research, Springer, vol. 222(1), pages 125-141, November.
    2. Qin, Hu & Zhang, Zizhen & Qi, Zhuxuan & Lim, Andrew, 2014. "The freight consolidation and containerization problem," European Journal of Operational Research, Elsevier, vol. 234(1), pages 37-48.
    3. Leung, Joseph Y.-T. & Li, Chung-Lun, 2008. "An asymptotic approximation scheme for the concave cost bin packing problem," European Journal of Operational Research, Elsevier, vol. 191(2), pages 582-586, December.
    4. François Clautiaux & Cláudio Alves & José Valério de Carvalho & Jürgen Rietz, 2011. "New Stabilization Procedures for the Cutting Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 530-545, November.
    5. Istvan Borgulya, 2024. "A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 32(1), pages 45-65, March.
    6. Farahani, Amirreza & Genga, Laura & Schrotenboer, Albert H. & Dijkman, Remco, 2024. "Capacity planning in logistics corridors: Deep reinforcement learning for the dynamic stochastic temporal bin packing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 191(C).
    7. Qi Zhang & Shixin Liu & Ruiyou Zhang & Shujin Qin, 2021. "Column generation algorithms for mother plate design in steel plants," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 127-153, March.
    8. Wu, Yong & Li, Wenkai & Goh, Mark & de Souza, Robert, 2010. "Three-dimensional bin packing problem with variable bin height," European Journal of Operational Research, Elsevier, vol. 202(2), pages 347-355, April.
    9. Coutton, Baptiste & Pacino, Dario & Holst, Klaus & Guericke, Stefan & Kidd, Martin Philip, 2025. "Heuristic approaches for freight containerization with business rules," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 197(C).
    10. Andrea Bettinelli & Alberto Ceselli & Giovanni Righini, 2010. "A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint," Annals of Operations Research, Springer, vol. 179(1), pages 221-241, September.
    11. Martinovic, J. & Scheithauer, G. & Valério de Carvalho, J.M., 2018. "A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems," European Journal of Operational Research, Elsevier, vol. 266(2), pages 458-471.
    12. Lewis, R. & Song, X. & Dowsland, K. & Thompson, J., 2011. "An investigation into two bin packing problems with ordering and orientation implications," European Journal of Operational Research, Elsevier, vol. 213(1), pages 52-65, August.
    13. Kallrath, Julia & Rebennack, Steffen & Kallrath, Josef & Kusche, Rüdiger, 2014. "Solving real-world cutting stock-problems in the paper industry: Mathematical approaches, experience and challenges," European Journal of Operational Research, Elsevier, vol. 238(1), pages 374-389.
    14. Baldi, Mauro Maria & Crainic, Teodor Gabriel & Perboli, Guido & Tadei, Roberto, 2012. "The generalized bin packing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(6), pages 1205-1220.
    15. C Alves & J M Valério de Carvalho, 2008. "New integer programming formulations and an exact algorithm for the ordered cutting stock problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1520-1531, November.
    16. Ekici, Ali, 2023. "A large neighborhood search algorithm and lower bounds for the variable-Sized bin packing problem with conflicts," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1007-1020.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    2. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    3. Krzysztof C. Kiwiel, 2010. "An Inexact Bundle Approach to Cutting-Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 131-143, February.
    4. Belov, G. & Scheithauer, G., 2006. "A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting," European Journal of Operational Research, Elsevier, vol. 171(1), pages 85-106, May.
    5. Trkman, Peter & Gradisar, Miro, 2007. "One-dimensional cutting stock optimization in consecutive time periods," European Journal of Operational Research, Elsevier, vol. 179(2), pages 291-301, June.
    6. Reinertsen, Harald & Vossen, Thomas W.M., 2010. "The one-dimensional cutting stock problem with due dates," European Journal of Operational Research, Elsevier, vol. 201(3), pages 701-711, March.
    7. B. S. C. Campello & C. T. L. S. Ghidini & A. O. C. Ayres & W. A. Oliveira, 2022. "A residual recombination heuristic for one-dimensional cutting stock problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 194-220, April.
    8. Adejuyigbe O. Fajemisin & Steven D. Prestwich & Laura Climent, 2023. "Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(1), pages 139-164, April.
    9. Aktin, Tülin & Özdemir, RIfat Gürcan, 2009. "An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing," European Journal of Operational Research, Elsevier, vol. 196(2), pages 737-743, July.
    10. Muter, İbrahim & Sezer, Zeynep, 2018. "Algorithms for the one-dimensional two-stage cutting stock problem," European Journal of Operational Research, Elsevier, vol. 271(1), pages 20-32.
    11. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    12. Erjavec, J. & Gradisar, M. & Trkman, P., 2012. "Assessment of stock size to minimize cutting stock production costs," International Journal of Production Economics, Elsevier, vol. 135(1), pages 170-176.
    13. François Clautiaux & Cláudio Alves & José Valério de Carvalho & Jürgen Rietz, 2011. "New Stabilization Procedures for the Cutting Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 530-545, November.
    14. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    15. Letchford, Adam N. & Amaral, Andre, 2001. "Analysis of upper bounds for the Pallet Loading Problem," European Journal of Operational Research, Elsevier, vol. 132(3), pages 582-593, August.
    16. Elisama Araújo Silva Oliveira & Elizabeth Wanner & Elisangela Martins Sá & Sérgio Ricardo Souza, 2025. "A local branching-based solution for the multi-period cutting stock problem with tardiness, earliness, and setup costs," Journal of Heuristics, Springer, vol. 31(1), pages 1-57, March.
    17. Cizman, Anton & Cernetic, Janko, 2004. "Improving competitiveness in veneers production by a simple-to-use DSS," European Journal of Operational Research, Elsevier, vol. 156(1), pages 241-260, July.
    18. Maxence Delorme & Manuel Iori, 2020. "Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 101-119, January.
    19. Kelly Cristina Poldi & Silvio Alexandre Araujo, 2016. "Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem," Annals of Operations Research, Springer, vol. 238(1), pages 497-520, March.
    20. Sierra-Paradinas, María & Soto-Sánchez, Óscar & Alonso-Ayuso, Antonio & Martín-Campo, F. Javier & Gallego, Micael, 2021. "An exact model for a slitting problem in the steel industry," European Journal of Operational Research, Elsevier, vol. 295(1), pages 336-347.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:183:y:2007:i:3:p:1333-1352. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.