Online square and cube packing (Q2570973)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Online square and cube packing	scientific article

Statements

scholarly article

0 references

Online square and cube packing (English)

0 references

0 references

0 references

Acta Informatica

0 references

publication date

31 October 2005

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00236-005-0169-z

0 references

Multidimensional on-line bin packing: Algorithms and worst-case analysis

0 references

Algorithms – ESA 2004

0 references

0 references

Fast algorithms for bin packing

0 references

Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

0 references

A simple on-line bin-packing algorithm

0 references

A lower bound for on-line bin packing

0 references

0 references

On-line bin packing in linear time

0 references

On the online bin packing problem

0 references

New bounds for multidimensional packing

0 references

Toeplitz Matrices Associated with a Semi-Infinite Laurent Series

0 references

An improved lower bound for on-line bin packing algorithms

0 references

New Algorithms for Bin Packing

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s00236-005-0169-z

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2570973

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