Models and complexity of multibin packing problems

DOI10.1007/S10852-005-9025-YMaRDI QIDQ864931zbMATH OpenOpenAlexFDO

Authors Gerd Finke, Pierre Lemaire, Nadia Brauner

Publication date 13 February 2007

Published in JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10852-005-9025-y

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 2221466
• Multidimensional Bin Packing Algorithms
• An asymptotically exact algorithm for the high-multiplicity bin packing problem
• Upper bounds and algorithms for the maximum cardinality bin packing problem.
• On the generalized bin packing problem

Cites work

• An approximation scheme for bin packing with conflicts
• An efficient algorithm for the ring loading problem with integer demand splitting
• An exact algorithm for the dual bin packing problem
• Complexity of Scheduling Parallel Task Systems
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1302193 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 1128827 (Why is no real title available?)
• scientific article; zbMATH DE number 871903 (Why is no real title available?)
• scientific article; zbMATH DE number 2221466 (Why is no real title available?)
• Matching theory
• Models and complexity of multibin packing problems
• Mutual exclusion scheduling
• Scheduling multiprocessor tasks -- An overview
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Scheduling with deadlines and loss functions
• Scheduling with incompatible jobs
• The Ring Loading Problem
• Upper bounds and algorithms for the maximum cardinality bin packing problem.

Cited in

(9)

• LP models for bin packing and cutting stock problems
• Solving the weighted capacitated planned maintenance problem and its variants
• Solving bin packing problems using VRPSolver models
• Bin completion algorithms for multicontainer packing, Knapsack, and covering problems
• Multidimensional Bin Packing Algorithms
• An MDD approach to multidimensional bin packing
• scientific article; zbMATH DE number 2221466 (Why is no real title available?)
• Complexity of core allocation for the bin packing game
• Models and complexity of multibin packing problems

This page was built for publication: Models and complexity of multibin packing problems

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