Fast lifting procedures for the bin packing problem

DOI10.1016/J.DISOPT.2005.06.002MaRDI QIDQ2581316zbMATH OpenOpenAlexFDO

Authors Mohamed Haouari, Anis Gharbi

Publication date 9 January 2006

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2005.06.002

zbMATH Keywords

bin packingdual feasible functionslower bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete location and assignment (90B80)

Recommendations

• New bin packing fast lower bounds
• New classes of fast lower bounds for bin packing problems
• An analysis of lower bound procedures for the bin packing problem
• Lower bounds and reduction procedures for the bin packing problem
• scientific article; zbMATH DE number 1187157

Cites work

• An improved lower bound for the bin packing problem
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• Computational study of a column generation algorithm for bin packing and cutting stock problems
• Exact solution of bin-packing problems using column generation and branch-and-bound
• scientific article; zbMATH DE number 3890754 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Lower bounds for scheduling on identical parallel machines with heads and tails
• New classes of fast lower bounds for bin packing problems
• New heuristics for one-dimensional bin-packing
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Ranking lower bounds for the bin-packing problem
• The integration of an interior-point cutting plane method within a branch-and-price algorithm

Cited in

(10)

• Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
• On LP relaxations for the pattern minimization problem
• New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem
• Procedures for the bin packing problem with precedence constraints
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Tight bounds for the identical parallel machine scheduling problem
• A new destructive bounding scheme for the bin packing problem
• New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
• Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
• New bin packing fast lower bounds

Describes a project that uses

Uses Software

• Bison

This page was built for publication: Fast lifting procedures for the bin packing problem

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