Batched bin packing revisited (Q2398649)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Batched bin packing revisited	scientific article

Statements

scholarly article

0 references

Batched bin packing revisited (English)

0 references

Journal of Scheduling

0 references

publication date

18 August 2017

0 references

zbMATH Keywords

batched bin packing

0 references

graph-bin packing

0 references

tight bound

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10951-015-0431-3

0 references

New lower bounds for certain classes of bin packing algorithms

0 references

Lower bound for 3-batched bin packing

0 references

THE GRAPH-BIN PACKING PROBLEM

0 references

Bin packing can be solved within 1+epsilon in linear time

0 references

Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)

0 references

0 references

Optimal Analysis of Best Fit Bin Packing

0 references

On Bin Packing with Conflicts

0 references

0 references

Batched bin packing

0 references

An approximation scheme for bin packing with conflicts

0 references

A simple on-line bin-packing algorithm

0 references

On the online bin packing problem

0 references

An improved lower bound for on-line bin packing algorithms

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S10951-015-0431-3

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2398649

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2398649&oldid=39057457"