IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v255y2016i1p1-20.html
   My bibliography  Save this item

Bin packing and cutting stock problems: Mathematical models and exact algorithms

Citations

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


Cited by:

  1. Jean-François Côté & Manuel Iori, 2018. "The Meet-in-the-Middle Principle for Cutting and Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 646-661, November.
  2. Zhiling Guo & Jin Li & Ram Ramesh, 2023. "Green Data Analytics of Supercomputing from Massive Sensor Networks: Does Workload Distribution Matter?," Information Systems Research, INFORMS, vol. 34(4), pages 1664-1685, December.
  3. Mohsen Emadikhiav & David Bergman & Robert Day, 2020. "Consistent Routing and Scheduling with Simultaneous Pickups and Deliveries," Production and Operations Management, Production and Operations Management Society, vol. 29(8), pages 1937-1955, August.
  4. Mohamad Alissa & Kevin Sim & Emma Hart, 2023. "Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches," Journal of Heuristics, Springer, vol. 29(1), pages 1-38, February.
  5. Jean-François Côté & Mohamed Haouari & Manuel Iori, 2021. "Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 963-978, July.
  6. Raphael Kramer & Manuel Iori & Thibaut Vidal, 2020. "Mathematical Models and Search Algorithms for the Capacitated p -Center Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 444-460, April.
  7. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
  8. Yang, Fan & Davari, Morteza & Wei, Wenchao & Hermans, Ben & Leus, Roel, 2022. "Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families," European Journal of Operational Research, Elsevier, vol. 303(2), pages 602-615.
  9. Martinovic, J. & Strasdat, N. & Valério de Carvalho, J. & Furini, F., 2023. "A combinatorial flow-based formulation for temporal bin packing problems," European Journal of Operational Research, Elsevier, vol. 307(2), pages 554-574.
  10. Walaa H. El-Ashmawi & Ahmad Salah & Mahmoud Bekhit & Guoqing Xiao & Khalil Al Ruqeishi & Ahmed Fathalla, 2023. "An Adaptive Jellyfish Search Algorithm for Packing Items with Conflict," Mathematics, MDPI, vol. 11(14), pages 1-28, July.
  11. 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.
  12. Dell’Amico, Mauro & Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2019. "Mathematical models and decomposition methods for the multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(3), pages 886-899.
  13. Schepler, Xavier & Rossi, André & Gurevsky, Evgeny & Dolgui, Alexandre, 2022. "Solving robust bin-packing problems with a branch-and-price approach," European Journal of Operational Research, Elsevier, vol. 297(3), pages 831-843.
  14. Roland Braune, 2022. "Packing-based branch-and-bound for discrete malleable task scheduling," Journal of Scheduling, Springer, vol. 25(6), pages 675-704, December.
  15. Delorme, Maxence & García, Sergio & Gondzio, Jacek & Kalcsics, Jörg & Manlove, David & Pettersson, William, 2019. "Mathematical models for stable matching problems with ties and incomplete lists," European Journal of Operational Research, Elsevier, vol. 277(2), pages 426-441.
  16. 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.
  17. Bertrand, J.W.M. & Fransoo, Jan C. & Udenio, Maximiliano, 2024. "Model-based research," Other publications TiSEM a4604c6c-f35c-4d85-ba6e-0, Tilburg University, School of Economics and Management.
  18. Oliveira, Washington A. & Fiorotto, Diego J. & Song, Xiang & Jones, Dylan F., 2021. "An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem," European Journal of Operational Research, Elsevier, vol. 295(3), pages 996-1007.
  19. Katrin Heßler & Timo Gschwind & Stefan Irnich, 2017. "Stabilized Branch-and-Price Algorithms for Vector Packing Problems," Working Papers 1713, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  20. Renatha Capua & Yuri Frota & Luiz Satoru Ochi & Thibaut Vidal, 2018. "A study on exponential-size neighborhoods for the bin packing problem with conflicts," Journal of Heuristics, Springer, vol. 24(4), pages 667-695, August.
  21. Christian Brandstätter, 2021. "A metaheuristic algorithm and structured analysis for the Line-haul Feeder Vehicle Routing Problem with Time Windows," 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. 29(1), pages 247-289, March.
  22. John Martinovic & Guntram Scheithauer, 2018. "Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case," Annals of Operations Research, Springer, vol. 271(2), pages 811-829, December.
  23. Wuttke, David A. & Heese, H. Sebastian, 2018. "Two-dimensional cutting stock problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 265(1), pages 303-315.
  24. Raphael Kramer & Mauro Dell’Amico & Manuel Iori, 2017. "A batching-move iterated local search algorithm for the bin packing problem with generalized precedence constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 55(21), pages 6288-6304, November.
  25. Kramer, Arthur & Dell’Amico, Mauro & Iori, Manuel, 2019. "Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines," European Journal of Operational Research, Elsevier, vol. 275(1), pages 67-79.
  26. Manuel V. C. Vieira & Margarida Carvalho, 2023. "Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer," 4OR, Springer, vol. 21(3), pages 491-512, September.
  27. Hao, Xinye & Zheng, Li & Li, Na & Zhang, Canrong, 2022. "Integrated bin packing and lot-sizing problem considering the configuration-dependent bin packing process," European Journal of Operational Research, Elsevier, vol. 303(2), pages 581-592.
  28. Thanh-Hung Nguyen & Xuan-Thuan Nguyen, 2023. "Space Splitting and Merging Technique for Online 3-D Bin Packing," Mathematics, MDPI, vol. 11(8), pages 1-16, April.
  29. John Martinovic & Markus Hähnel & Guntram Scheithauer & Waltenegus Dargie & Andreas Fischer, 2019. "Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation," 4OR, Springer, vol. 17(2), pages 173-200, June.
  30. Wang, Danni & Xiao, Fan & Zhou, Lei & Liang, Zhe, 2020. "Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation," European Journal of Operational Research, Elsevier, vol. 286(2), pages 547-563.
  31. Kramer, Arthur & Lalla-Ruiz, Eduardo & Iori, Manuel & Voß, Stefan, 2019. "Novel formulations and modeling enhancements for the dynamic berth allocation problem," European Journal of Operational Research, Elsevier, vol. 278(1), pages 170-185.
  32. Artur Pessoa & Ruslan Sadykov & Eduardo Uchoa, 2021. "Solving Bin Packing Problems Using VRPSolver Models," SN Operations Research Forum, Springer, vol. 2(2), pages 1-25, June.
  33. John Martinovic, 2022. "A note on the integrality gap of cutting and skiving stock instances," 4OR, Springer, vol. 20(1), pages 85-104, March.
  34. Orlando Rivera Letelier & François Clautiaux & Ruslan Sadykov, 2022. "Bin Packing Problem with Time Lags," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2249-2270, July.
  35. Clautiaux, François & Hanafi, Saïd & Macedo, Rita & Voge, Marie-Émilie & Alves, Cláudio, 2017. "Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints," European Journal of Operational Research, Elsevier, vol. 258(2), pages 467-477.
  36. S. Basso & A. Ceselli & A. Tettamanzi, 2020. "Random sampling and machine learning to understand good decompositions," Annals of Operations Research, Springer, vol. 284(2), pages 501-526, January.
  37. Haoqing Wang & Wen Yi, 2022. "Optimization Models for Reducing Off-Cuts of Raw Materials in Construction Site," Mathematics, MDPI, vol. 10(24), pages 1-16, December.
  38. Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim, 2020. "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 428-443, April.
  39. Novak, Antonin & Sucha, Premysl & Hanzalek, Zdenek, 2019. "Scheduling with uncertain processing times in mixed-criticality systems," European Journal of Operational Research, Elsevier, vol. 279(3), pages 687-703.
  40. Pereira, Jordi & Ritt, Marcus, 2023. "Exact and heuristic methods for a workload allocation problem with chain precedence constraints," European Journal of Operational Research, Elsevier, vol. 309(1), pages 387-398.
  41. Heßler, Katrin & Gschwind, Timo & Irnich, Stefan, 2018. "Stabilized branch-and-price algorithms for vector packing problems," European Journal of Operational Research, Elsevier, vol. 271(2), pages 401-419.
  42. He, Dongdong & Ceder, Avishai (Avi) & Zhang, Wenyi & Guan, Wei & Qi, Geqi, 2023. "Optimization of a rural bus service integrated with e-commerce deliveries guided by a new sustainable policy in China," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 172(C).
  43. Luciano Costa & Claudio Contardo & Guy Desaulniers & Julian Yarkony, 2022. "Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1141-1156, March.
  44. Istvan Borgulya, 2021. "A hybrid evolutionary algorithm for the offline 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. 29(2), pages 425-445, June.
  45. Maxime C. Cohen & Philipp W. Keller & Vahab Mirrokni & Morteza Zadimoghaddam, 2019. "Overcommitment in Cloud Services: Bin Packing with Chance Constraints," Management Science, INFORMS, vol. 65(7), pages 3255-3271, July.
  46. 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.
  47. Mathijs Barkel & Maxence Delorme, 2023. "Arcflow Formulations and Constraint Generation Frameworks for the Two Bar Charts Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 35(2), pages 475-494, March.
  48. Becker, Henrique & Buriol, Luciana S., 2019. "An empirical analysis of exact algorithms for the unbounded knapsack problem," European Journal of Operational Research, Elsevier, vol. 277(1), pages 84-99.
  49. Katrin Heßler & Stefan Irnich & Tobias Kreiter & Ulrich Pferschy, 2022. "Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 1-43, June.
  50. 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.
  51. John Martinovic & Markus Hähnel & Guntram Scheithauer & Waltenegus Dargie, 2022. "An introduction to stochastic bin packing-based server consolidation with conflicts," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(2), pages 296-331, July.
  52. 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.
  53. Rapine, Christophe & Pedroso, Joao Pedro & Akbalik, Ayse, 2022. "The two-dimensional knapsack problem with splittable items in stacks," Omega, Elsevier, vol. 112(C).
  54. Hadj Salem, Khadija & Silva, Elsa & Oliveira, José Fernando & Carravilla, Maria Antónia, 2023. "Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry," European Journal of Operational Research, Elsevier, vol. 306(2), pages 549-566.
  55. Pascual, Fanny & Rzadca, Krzysztof, 2018. "Colocating tasks in data centers using a side-effects performance model," European Journal of Operational Research, Elsevier, vol. 268(2), pages 450-462.
  56. Diego Noceda-Davila & Silvia Lorenzo-Freire & Luisa Carpente, 2022. "Two-Stage Optimization Methods to Solve the DNA-Sample Allocation Problem," Mathematics, MDPI, vol. 10(22), pages 1-31, November.
  57. Claudio Arbib & Fabrizio Marinelli & Mustafa Ç. Pınar & Andrea Pizzuti, 2022. "Robust stock assortment and cutting under defects in automotive glass production," Production and Operations Management, Production and Operations Management Society, vol. 31(11), pages 4154-4172, November.
  58. Katrin Heßler & Stefan Irnich & Tobias Kreiter & Ulrich Pferschy, 2020. "Lexicographic Bin-Packing Optimization for Loading Trucks in a Direct-Shipping System," Working Papers 2009, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  59. Ruslan Sadykov & François Vanderbeck & Artur Pessoa & Issam Tahiri & Eduardo Uchoa, 2019. "Primal Heuristics for Branch and Price: The Assets of Diving Methods," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 251-267, April.
  60. Kramer, Arthur & Iori, Manuel & Lacomme, Philippe, 2021. "Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization," European Journal of Operational Research, Elsevier, vol. 289(3), pages 825-840.
  61. Bonassa, Antonio Carlos & Cunha, Claudio Barbieri da & Isler, Cassiano Augusto, 2023. "A multi-start local search heuristic for the multi-period auto-carrier loading and transportation problem in Brazil," European Journal of Operational Research, Elsevier, vol. 307(1), pages 193-211.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.