Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes

Mathematics of Operations Research - United States
doi 10.1287/moor.1050.0168
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

Bin Packing With Queues

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
2008English

On-Line Bin Packing in Linear Time

Journal of Algorithms
1989English

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

Dynamic Bin Packing of Unit Fractions Items

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

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

SIAM Review
Computational MathematicsApplied MathematicsTheoretical Computer Science
2002English

Bin Packing With Geometric Constraints in Computer Network Design

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1978English

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

ORiON
2010English

The Optimal Absolute Ratio for Online Bin Packing

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

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy