The Bin Packing Problem with Item Fragmentation:A worst-case analysis

2019 ◽  
Vol 261 ◽  
pp. 63-77 ◽  
Author(s):  
Luca Bertazzi ◽  
Bruce Golden ◽  
Xingyin Wang
Keyword(s):  
Bin Packing ◽  
Case Analysis ◽  
Packing Problem ◽  
Worst Case Analysis ◽  
Worst Case ◽  
Bin Packing Problem

scholarly journals On a generalized problem of bin packing

2015 ◽  
Vol 1 (2) ◽  
pp. 14-21
Author(s):  
Nguyen Trong
Keyword(s):  
Bin Packing ◽  
Heuristic Algorithms ◽  
Case Analysis ◽  
Packing Problem ◽  
Worst Case Analysis ◽  
Worst Case ◽  
Np Completeness ◽  
Bin Packing Problem

A generalization of the bin packing problem, called the DTMR problem is studied. The NP-completeness of  DTMR is proved. Three heuristic algorithms-the CNN, the CHT and the CSX are described and the worst-case analysis of them are given. Some applications of the DTMR are shown.

scholarly journals A-shaped bin packing: Worst case analysis via simulation

2005 ◽  
Vol 1 (3) ◽  
pp. 323-335
Author(s):  
Wenxun Xing ◽  
◽  
Feng Chen ◽  
Keyword(s):  
Bin Packing ◽  
Case Analysis ◽  
Worst Case Analysis ◽  
Worst Case

Worst-case analysis of the subset sum algorithm for bin packing

2004 ◽  
Vol 32 (2) ◽  
pp. 159-166 ◽  
Author(s):  
Alberto Caprara ◽  
Ulrich Pferschy
Keyword(s):  
Bin Packing ◽  
Case Analysis ◽  
Worst Case Analysis ◽  
Worst Case ◽  
Subset Sum

Worst-case analyses, linear programming and the bin-packing problem

1998 ◽  
Vol 83 (1-3) ◽  
pp. 213-227 ◽  
Author(s):  
Lap Mui Ann Chan ◽  
David Simchi-Levi ◽  
Julien Bramel
Keyword(s):  
Linear Programming ◽  
Bin Packing ◽  
Packing Problem ◽  
Worst Case ◽  
Bin Packing Problem
Sign in / Sign up

Export Citation Format

Share Document