New classes of lower bounds for bin packing problems

DOI10.1007/3-540-69346-7_20MaRDI QIDQ3840364zbMATH OpenFDO

Authors Sándor P. Fekete, Jörg Schepers

Publication date 19 April 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-69346-7_20

zbMATH Keywords

bin packingdual feasible functionslower boundsworst case analysis

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Recommendations

• New classes of fast lower bounds for bin packing problems
• New bin packing fast lower bounds
• An improved lower bound for the bin packing problem
• An analysis of lower bound procedures for the bin packing problem

Cited in

(28)

• On linear lower bounds for the resource constrained project scheduling problem.
• Lower bounds for a bin packing problem with linear usage cost
• Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
• New lower bounds for the three-dimensional finite bin packing problem
• Two-dimensional packing problems: a survey
• Ranking lower bounds for the bin-packing problem
• An improved lower bound for the bin packing problem
• A new lower bound on the price of anarchy of selfish bin packing
• Fast lifting procedures for the bin packing problem
• Computing the asymptotic worst-case of bin packing lower bounds
• Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
• New Lower Bounds for Certain Classes of Bin Packing Algorithms
• New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem
• The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
• Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
• A preemptive bound for the resource constrained project scheduling problem
• New lower bounds for certain classes of bin packing algorithms
• Online square packing with gravity
• Efficient algorithms for orthogonal packing problems
• A new lower bound for classic online bin packing
• New classes of fast lower bounds for bin packing problems
• New heuristics for one-dimensional bin-packing
• A new destructive bounding scheme for the bin packing problem
• Recent advances on two-dimensional bin packing problems
• Computing redundant resources for the resource constrained project scheduling problem
• Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
• New bin packing fast lower bounds
• Lower bounds and reduction procedures for the bin packing problem

This page was built for publication: New classes of lower bounds for bin packing problems

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