Models and complexity of multibin packing problems

DOI10.1007/s10852-005-9025-yzbMath1156.90432OpenAlexW2025093995MaRDI QIDQ864931

Gerd Finke, Nadia Brauner, Pierre Lemaire

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

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

Related Items

Models and complexity of multibin packing problems ⋮ Solving the weighted capacitated planned maintenance problem and its variants

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Models and complexity of multibin packing problems
• Matching theory
• Scheduling multiprocessor tasks -- An overview
• Scheduling with incompatible jobs
• Mutual exclusion scheduling
• Upper bounds and algorithms for the maximum cardinality bin packing problem.
• An exact algorithm for the dual bin packing problem
• An approximation scheme for bin packing with conflicts
• An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting
• Scheduling with Deadlines and Loss Functions
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Complexity of Scheduling Parallel Task Systems
• The Ring Loading Problem