Lower and upper bounds for the bin packing problem with fragile objects

DOI10.1016/j.dam.2012.04.010zbMath1303.90087OpenAlexW1999835659WikidataQ59222241 ScholiaQ59222241MaRDI QIDQ406499

Manuel Iori, Mauro Dell'Amico, François Clautiaux, Ali Khanafer

Publication date: 8 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.04.010

zbMATH Keywords

column generationvariable neighborhood searchbin packing problemdual cutsfragile objects

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Vehicle scheduling under the warehouse-on-wheels policy, The bin packing problem with item fragmentation: a worst-case analysis, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, Bin packing with directed stackability conflicts

Uses Software

• CALMA
• Knapsack
• Tabu search
• Bison

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of dual-feasible and superadditive functions
• Variable neighbourhood search: methods and applications
• New lower bounds for bin packing problems with conflicts
• Approximation algorithms for combinatorial problems
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• Variable neighborhood search
• The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
• Heuristics and lower bounds for the bin packing problem with conflicts
• LP models for bin packing and cutting stock problems
• Record breaking optimization results using the ruin and recreate principle
• Online bin packing of fragile objects with application in cellular networks
• Using Extra Dual Cuts to Accelerate Column Generation
• Algorithms for the Bin Packing Problem with Conflicts
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• A Linear Programming Approach to the Cutting-Stock Problem
• An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
• Matheuristics
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Models and solution techniques for frequency assignment problems