Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing (Q5479859): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1051/ro:2006001 / rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2026961896 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a dual version of the one-dimensional bin packing problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bin covering algorithms in the second stage of the lot to order matching problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2707233 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2768348 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the sum-of-squares algorithm for bin packing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Online algorithms for a dual version of bin packing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A simple on-line bin-packing algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4552137 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4820876 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An improved lower bound for on-line bin packing algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal on-line algorithms for variable-sized bin covering / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1051/RO:2006001 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 17:04, 30 December 2024
scientific article; zbMATH DE number 5039992
Language | Label | Description | Also known as |
---|---|---|---|
English | Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing |
scientific article; zbMATH DE number 5039992 |
Statements
Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing (English)
0 references
11 July 2006
0 references
online approximation algorithm
0 references
asymptotic worst case ratio
0 references
bin covering problem
0 references
bin packing problem
0 references
longest item
0 references
uniform sized bins
0 references