Bin covering with a general profit function : approximability results
Year of publication: |
2013
|
---|---|
Authors: | Benkő, Attila ; Dósa, György ; Tuza, Zsolt |
Published in: |
Central European journal of operations research : CEJOR ; official journal of the Austrian, Croatian, Czech, Hungarian, Slovakian and Slovenian OR Societies. - Berlin : Springer, ISSN 1435-246X, ZDB-ID 1178875-6. - Vol. 21.2013, 4, p. 805-816
|
Subject: | Bin covering | Polynomial-time exact algorithm | Approximation algorithm | Non-approximability | Algorithmus | Algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics |
-
Lower bounds and algorithms for the minimum cardinality bin covering problem
Walter, Rico, (2017)
-
The bin covering with delivery problem, extended investigations for the online case
Abraham, Gyula, (2023)
-
Ozturk, Onur, (2017)
- More ...
-
Dósa, György, (2011)
-
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György, (2018)
-
Extremal behavior of the Greedy algorithm for a triangle scheduling problem
Balogh, János, (2024)
- More ...