On two dimensional packing (Q5054823)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7631767

Language	Label	Description	Also known as
English	On two dimensional packing	scientific article; zbMATH DE number 7631767

Statements

scholarly article

0 references

On two dimensional packing (English)

0 references

0 references

0 references

Algorithm Theory — SWAT'96

0 references

publication date

9 December 2022

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/3-540-61422-2_142

0 references

Orthogonal Packings in Two Dimensions

0 references

New algorithms for an ancient scheduling problem.

0 references

A better lower bound for on-line scheduling

0 references

New lower and upper bounds for on-line scheduling

0 references

Two-dimensional rectangle packing: On-line methods and results

0 references

Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

0 references

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

0 references

0 references

Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms

0 references

An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling

0 references

Bounds for Certain Multiprocessing Anomalies

0 references

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

0 references

0 references

A lower bound for on-line bin packing

0 references

New Algorithms for Bin Packing

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/3-540-61422-2_142

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5054823

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