Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures

DOI10.1287/OPRE.42.2.287MaRDI QIDQ4301293zbMATH OpenOpenAlexFDO

Authors Shoshana Anily, David Simchi-Levi, Julien Bramel

Publication date 20 September 1994

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/1a6a493be020bb42d93b72be1a9b74ff74567a6a

zbMATH Keywords

heuristicsbin packingworst-case boundnext-fit decreasingnext-fit increasing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Bin‐packing problem with concave costs of bin utilization
• scientific article; zbMATH DE number 1084196
• Bin packing with general cost structures
• scientific article; zbMATH DE number 563208
• Worst-case analysis of the subset sum algorithm for bin packing.

Cited in

(19)

• Bin packing with general cost structures
• Modified subset sum heuristics for bin packing
• Lower bounds for a bin packing problem with linear usage cost
• AN APPROACH FOR WORST CASE ANALYSIS OF HEURISTICS : ANALYSIS OF A FLEXIBLE 0-1 KNAPSACK PROBLEM
• Lower and upper bounding procedures for the bin packing problem with concave loading cost
• Parameterized complexity of configuration integer programs
• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
• A-shaped bin packing: Worst case analysis via simulation
• Batch scheduling of nonidentical job sizes with minsum criteria
• Augmented neural networks and problem structure-based heuristics for the bin-packing problem
• Bin‐packing problem with concave costs of bin utilization
• An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs
• Worst case analysis of relax and fix heuristics for lot-sizing problems
• Scheduling with tool changes to minimize total completion time: Basic results and SPT performance
• Exact and approximate methods for a one-dimensional minimax bin-packing problem
• An asymptotic approximation scheme for the concave cost bin packing problem
• On solving multiobjective bin packing problems using evolutionary particle swarm optimization
• Worst-case analysis of fast heuristics for packing squares into a square
• An enhanced grasshopper optimization algorithm to the Bin packing problem

This page was built for publication: Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures

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