1. //
  2. Start
  3. //
  4. Publikationen
  5. A Class of Simple Stochastic Online Bin ...
  6. Formate
  7. //

A Class of Simple Stochastic Online Bin Packing Algorithms

Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet

Standard

A Class of Simple Stochastic Online Bin Packing Algorithms. / Hoffmann, Ulrich.
in: Computing, Jahrgang 29, Nr. 3, 01.09.1982, S. 227-239.

Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet

Harvard

Hoffmann, U 1982, 'A Class of Simple Stochastic Online Bin Packing Algorithms', Computing, Jg. 29, Nr. 3, S. 227-239. https://doi.org/10.1007/BF02241699

APA

Hoffmann, U. (1982). A Class of Simple Stochastic Online Bin Packing Algorithms. Computing, 29(3), 227-239. https://doi.org/10.1007/BF02241699

Vancouver

Hoffmann U. A Class of Simple Stochastic Online Bin Packing Algorithms. Computing. 1982 Sep 1;29(3):227-239. doi: 10.1007/BF02241699

Bibtex

@article{94bf60abbf5d4203a007f6a166d004d0,
title = "A Class of Simple Stochastic Online Bin Packing Algorithms",
abstract = "In the one-dimensional bin packing problem a list of n items has to be packed into a minimum number of unit-capacity bins. A class of linear online algorithms for the approximate solution of bin packing with items drawn from a known probability distribution is presented. Each algorithm depends on the distribution and on a parameter controlling the performance of the algorithm. It is shown that with increasing number of items the expected performance ratio has an arbitrary small deviation from optimum.",
keywords = "Informatics, AMS Subject Classifications: 68C25, approximation algorithms, Bin packing, stochastic algorithms",
author = "Ulrich Hoffmann",
year = "1982",
month = sep,
day = "1",
doi = "10.1007/BF02241699",
language = "English",
volume = "29",
pages = "227--239",
journal = "Computing",
issn = "0010-485X",
publisher = "Springer",
number = "3",

}

RIS

TY - JOUR

T1 - A Class of Simple Stochastic Online Bin Packing Algorithms

AU - Hoffmann, Ulrich

PY - 1982/9/1

Y1 - 1982/9/1

N2 - In the one-dimensional bin packing problem a list of n items has to be packed into a minimum number of unit-capacity bins. A class of linear online algorithms for the approximate solution of bin packing with items drawn from a known probability distribution is presented. Each algorithm depends on the distribution and on a parameter controlling the performance of the algorithm. It is shown that with increasing number of items the expected performance ratio has an arbitrary small deviation from optimum.

AB - In the one-dimensional bin packing problem a list of n items has to be packed into a minimum number of unit-capacity bins. A class of linear online algorithms for the approximate solution of bin packing with items drawn from a known probability distribution is presented. Each algorithm depends on the distribution and on a parameter controlling the performance of the algorithm. It is shown that with increasing number of items the expected performance ratio has an arbitrary small deviation from optimum.

KW - Informatics

KW - AMS Subject Classifications: 68C25

KW - approximation algorithms

KW - Bin packing

KW - stochastic algorithms

UR - http://www.scopus.com/inward/record.url?scp=0020280013&partnerID=8YFLogxK

UR - https://www.mendeley.com/catalogue/b374faad-ba37-35d2-b45b-97e540d7b078/

U2 - 10.1007/BF02241699

DO - 10.1007/BF02241699

M3 - Journal articles

VL - 29

SP - 227

EP - 239

JO - Computing

JF - Computing

SN - 0010-485X

IS - 3

ER -

In der gleichen Zeitschrift

Ein modifiziertes Newton-Verfahren zur Lösung des Hochrechnungsproblems nach dem Prinzip des minimalen Informationsverlustes

Merz, J., 01.03.1985, in: Computing. 35, 1, S. 51-61 11 S.

Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet

Weitere Publikationen dieser Person(en)

Datenstrukturen und Algorithmen: Grundlagen, Basisalgorithmen und Lösungsstrategien für sequentielle und parallele Algorithmen

Hoffmann, U., 2013, Lüneburg: Universität Lüneburg, 403 S. (FINAL; Band 23, Nr. 3).

Publikation: Arbeits- oder Diskussionspapiere und Berichte › Arbeits- oder Diskussionspapiere

Datenverarbeitungssystem 1

Hoffmann, U., 1995, Lüneburg: Universität Lüneburg, 220 S. (Final; Band 4, Nr. 5).

Publikation: Arbeits- oder Diskussionspapiere und Berichte › Arbeits- oder Diskussionspapiere

Datenverarbeitungssystem 2

Hoffmann, U., 1995, Lüneburg: Universität Lüneburg, S. 221-397, 177 S. (Final; Band 5, Nr. 2).

Publikation: Arbeits- oder Diskussionspapiere und Berichte › Arbeits- oder Diskussionspapiere

Einführung in die systemnahe Programmierung: Anwenderprogramme und Datenstrukturen

Hoffmann, U., 1990, Berlin: Walter de Gruyter GmbH. 371 S. (Programmierung komplexer Systeme; Band 5)

Publikation: Bücher und Anthologien › Monografien › Lehre › begutachtet

Grundlagen und Modelle der Programmierung

Hoffmann, U., 2013, Berlin: Lehmanns Media. 357 S. (Programmierung komplexer Systeme; Band 2)

Publikation: Bücher und Anthologien › Monografien › Lehre › begutachtet

DOI

Zuletzt angesehen

Publikationen

  1. Wirkungen der Beschäftigungspflicht schwerbehinderter Arbeitnehmer
  2. Consistent drivers of plant biodiversity across managed ecosystems
  3. Freie Berufe im Mikrozensus II - Einkommen und Einkommensverteilung
  4. Transfer operator-based extraction of coherent features on surfaces
  5. Offline question answering over linked data using limited resources
  6. Foraging wireworms are attracted to root-produced volatile aldehydes
  7. Machine vision system errors for unmanned aerial vehicle navigation
  8. Employing a Novel Metaheuristic Algorithm to Optimize an LSTM Model
  9. Prospective material flow analysis of the end-of-life decommissioning
  10. Climate change and modelling of extreme temperatures in Switzerland
  11. Humane Orientation as a New Cultural Dimension of the GLOBE Project:
  12. Measurement approaches for inigrated reporting adoption and quality
  13. Detection of oscillations with application in the pantograph control
  14. Intensity of Time and Income Interdependent Multidimensional Poverty:
  15. Abundance of large old trees in wood-pastures of Transylvania (Romania)
  16. Drawing as a Generative Activity and Drawing as a Prognostic Activity
  17. Credit frictions, selection into external finance and gains from trade
  18. Lagrangian analysis of long-term dynamics of turbulent superstructures
  19. The Rise and Fall of Electricity Distribution Cooperatives in Germany
  20. Web-based depression treatment for type 1 and type 2 diabetic patients
  21. Assessing Printability Maps in Additive Manufacturing of Metal Alloys