Lower and upper bounds for the bin packing problem with fragile objects
DOI10.1016/J.DAM.2012.04.010zbMATH Open1303.90087OpenAlexW1999835659WikidataQ59222241 ScholiaQ59222241MaRDI QIDQ406499FDOQ406499
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
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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Title not available (Why is that?)
- A Linear Programming Approach to the Cutting-Stock Problem
- Approximation algorithms for combinatorial problems
- Title not available (Why is that?)
- Heuristics and lower bounds for the bin packing problem with conflicts
- Algorithms for the bin packing problem with conflicts
- New lower bounds for bin packing problems with conflicts
- Variable neighborhood search
- LP models for bin packing and cutting stock problems
- Matheuristics
- Title not available (Why is that?)
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Variable neighbourhood search: methods and applications
- Record breaking optimization results using the ruin and recreate principle
- A survey of dual-feasible and superadditive functions
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- Title not available (Why is that?)
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Using extra dual cuts to accelerate column generation
- Models and solution techniques for frequency assignment problems
- Online bin packing of fragile objects with application in cellular networks
- An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
Cited In (6)
- The bin packing problem with item fragmentation: a worst-case analysis
- Vehicle scheduling under the warehouse-on-wheels policy
- Online bin packing of fragile objects with application in cellular networks
- Algorithms for the bin packing problem with scenarios
- Bin packing with directed stackability conflicts
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
Uses Software
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)
