Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing

SIAM Review - United States
doi 10.1137/s0036144501395423
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Bin Packing With Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings

SIAM Journal on Discrete Mathematics
Mathematics
2000English

The Optimal Absolute Ratio for Online Bin Packing

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
2019English

Average-Case Analyses of First Fit and Random Fit Bin Packing

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2000English

Online Bin Packing With Resource Augmentation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Online Bin Packing With Cardinality Constraints

SIAM Journal on Discrete Mathematics
Mathematics
2006English

Bin Packing With Queues

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
2008English

Some Packing and Covering Theorems

Colloquium Mathematicum
Mathematics
1967English

Modified Strip Packing Heuristics for the Rectangular Variable-Sized Bin Packing Problem

ORiON
2010English

Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy