A study on load-balanced variants of the bin packing problem

DOI10.1016/j.dam.2018.07.010zbMath1422.90042arXiv1810.12086OpenAlexW2962911212MaRDI QIDQ2422735

D. Castro-Silva, Eric Gourdin

Publication date: 20 June 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.12086

zbMATH Keywords

polynomial-time algorithmload balancingbin packingmixed integer models

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items (1)

EPTAS for the dual of splittable bin packing with cardinality constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Mathematical programming algorithms for bin packing problems with item fragmentation
• Approximation schemes for packing with item fragmentation
• A 71/60 theorem for bin packing
• Bin packing can be solved within 1+epsilon in linear time
• LP models for bin packing and cutting stock problems
• Approximation schemes for packing splittable items with cardinality constraints
• Mathematical Methods of Organizing and Planning Production
• The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Reducibility among Combinatorial Problems

This page was built for publication: A study on load-balanced variants of the bin packing problem