New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem

DOI10.1080/00207540802426656zbMath1231.90319OpenAlexW2163871914MaRDI QIDQ3114308

François Clautiaux, Aziz Moukrim, Jacques Carlier

Publication date: 4 February 2012

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540802426656

zbMATH Keywords

bin-packingdual-feasible functionsdata-dependent dual-feasible functions

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (6)

Conservative scales in packing problems ⋮ A new constraint programming approach for the orthogonal packing problem ⋮ Using dual feasible functions to construct fast lower bounds for routing and location problems ⋮ A new exact method for the two-dimensional bin-packing problem with fixed orientation ⋮ Unnamed Item ⋮ The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem

Cites Work

• Unnamed Item
• A general framework for bounds for higher-dimensional orthogonal packing problems.
• Computing redundant resources for the resource constrained project scheduling problem
• New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
• A new LP-based lower bound for the cumulative scheduling problem
• A tight lower bound for optimal bin packing
• A new exact method for the two-dimensional bin-packing problem with fixed orientation
• Fast lifting procedures for the bin packing problem
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• Ond-threshold graphs andd-dimensional bin packing

This page was built for publication: New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem