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

DOI10.1016/J.DAM.2012.04.010MaRDI QIDQ406499zbMATH OpenOpenAlexWikidataFDO

Authors François Clautiaux, Mauro Dell'Amico, Manuel Iori, 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)

Recommendations

• Exact algorithms for the bin packing problem with fragile objects
• Online bin packing of fragile objects with application in cellular networks
• Mathematical programming algorithms for bin packing problems with item fragmentation
• New formulations for variable cost and size bin packing problems with item fragmentation
• Bin packing with fragmentable items: presentation and approximations

Cites work

• scientific article; zbMATH DE number 6118219 (Why is no real title available?)
• scientific article; zbMATH DE number 23663 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• A Linear Programming Approach to the Cutting-Stock Problem
• A survey of dual-feasible and superadditive functions
• Algorithms for the bin packing problem with conflicts
• An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
• Approximation algorithms for combinatorial problems
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Heuristics and lower bounds for the bin packing problem with conflicts
• LP models for bin packing and cutting stock problems
• Matheuristics
• Metaheuristics. From design to implementation.
• Models and solution techniques for frequency assignment problems
• New lower bounds for bin packing problems with conflicts
• Online bin packing of fragile objects with application in cellular networks
• Record breaking optimization results using the ruin and recreate principle
• The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
• Using extra dual cuts to accelerate column generation
• Variable neighborhood search
• Variable neighbourhood search: methods and applications

Cited in

(7)

• Algorithms for the bin packing problem with scenarios
• Exact algorithms for the bin packing problem with fragile objects
• The bin packing problem with item fragmentation: a worst-case analysis
• Online bin packing of fragile objects with application in cellular networks
• Bin packing with directed stackability conflicts
• Vehicle scheduling under the warehouse-on-wheels policy
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers

Describes a project that uses

Uses Software

• CALMA
• Knapsack
• Tabu search
• Bison

This page was built for publication: Lower and upper bounds for the bin packing problem with fragile objects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406499)