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 | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
Xu, Zhou, (2015)
-
Scheduling unrelated machines with two types of jobs
Vakhania, Nodari, (2014)
-
Providing consistent opinions from online reviews : a heuristic stepwise optimization approach
Zhang, Zunqiang, (2016)
- More ...
-
Dósa, György, (2011)
-
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György, (2019)
-
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György, (2018)
- More ...