Exact algorithms for the bin packing problem with fragile objects

DOI10.1016/j.disopt.2013.06.001zbMath1506.90212OpenAlexW2137785403WikidataQ59222247 ScholiaQ59222247MaRDI QIDQ1662100

François Clautiaux, Mauro Dell'Amico, Manuel Iori, Manuel A. Alba Martínez

Publication date: 17 August 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2013.06.001

zbMATH Keywords

branch-and-boundbranch-and-pricebin packingfragile objects

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

Exactly solving packing problems with fragmentation

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• A survey of dual-feasible and superadditive functions
• Branching in branch-and-price: A generic scheme
• A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
• LP models for bin packing and cutting stock problems
• 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
• New Stabilization Procedures for the Cutting Stock Problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• The Knapsack Problem with Conflict Graphs
• A Linear Programming Approach to the Cutting-Stock Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II