Tighter bounds for the harmonic bin packing algorithm
Year of publication: |
2024
|
---|---|
Authors: | Epstein, Leah |
Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 316.2024, 1 (1.7.), p. 72-84
|
Subject: | Asymptotic approximation ratio | Bin packing | Bounded space algorithms | Algorithmus | Algorithm | Theorie | Theory | Packproblem | Packing problem | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Operations Research | Operations research |
-
Bin packing and cutting stock problems : mathematical models and exact algorithms
Delorme, Maxence, (2016)
-
A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems
Wei, Lijun, (2020)
-
Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems
Delorme, Maxence, (2020)
- More ...
-
On-line scheduling of unit time jobs with rejection: minimizing the total completion time
Epstein, Leah, (2002)
-
Optimal preemptive semi-online scheduling to minimize makespan on two related machines
Epstein, Leah, (2002)
-
Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
Epstein, Leah, (2001)
- More ...