Approximation algorithms for the square min-sum bin packing problem

DOI10.1007/S10878-026-01425-4MaRDI QIDQ7296596zbMATH OpenFDO

Authors Rachel Vanucchi Saraiva, Rafael C. S. Schouery

Publication date 14 July 2026

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10878-026-01425-4

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A survey of scheduling with parallel batch (p-batch) processing
• An approximation algorithm for square packing.
• Approximation and online algorithms for multidimensional bin packing: a survey
• Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
• Min-sum bin packing
• Minimum Weighted Sum Bin Packing
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Some packing and covering theorems

This page was built for publication: Approximation algorithms for the square min-sum bin packing problem

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