A Class of Simple Stochastic Online Bin Packing Algorithms

Publikation: Beiträge in ZeitschriftenZeitschriftenaufsätzeForschungbegutachtet

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 ZeitschriftenZeitschriftenaufsätzeForschungbegutachtet

Harvard

APA

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 -

DOI

Zuletzt angesehen

Publikationen

  1. Geometric analysis of a laser scanner functioning based on dynamic triangulation
  2. Cost effectiveness of guided Internet-based interventions for depression in comparison with control conditions
  3. Managing Global Production Networks
  4. Interactions between ecosystem properties and land use clarify spatial strategies to optimize trade-offs between agriculture and species conservation
  5. Effect of yttrium addition on lattice parameter, Young's modulus and vacancy of magnesium
  6. Article 11: Formal validity
  7. An approach for dynamic triangulation using servomotors
  8. Introduction to the U.S. Foreign Corrupt Practices Act in German
  9. Modeling a modular omnidirectional AGV developmental platform with integrated suspension and power-plant
  10. Ob lang oder kurz, berührbar oder nicht: Ist die Längenschätzkompetenz eindimensional?
  11. Generative 3D reconstruction of Ti-6Al-4V basketweave microstructures by optimization of differentiable microstructural descriptors
  12. Learning how to request using textbooks
  13. Data Practices
  14. Othering Space
  15. Canopy leaf traits, basal area, and age predict functional patterns of regenerating communities in secondary subtropical forests
  16. Photodegradation of micropollutants using V-UV/UV-C processes
  17. Using a CRIS to reduce workload and increase quality for research reporting and university marketing
  18. Systematic engineering design helps creating new soft machines
  19. Spaces with a temper
  20. A Besov space mapping property for the double layer potential on polygons
  21. A model of a servo piezo mechanical hydraulic actuator and its regulation using repetitive control
  22. Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization
  23. "And I Think That Is a Very Straightforward Way of Dealing With It''
  24. Development and validation of the Later Life Work Index for successful management of an aging workforce
  25. Creating a space for cooperation
  26. Kontext
  27. Wireless power transmission via a multi-coil inductive system
  28. How secondary-school students deal with issues of sustainable development in class*
  29. Chapter 9: Particular Remedies for Non-performance: Section 1: Right to Performance