Fast algorithms for bin packing

Cites work

A Note on the Efficiency of Hashing Functions
Binary Search Trees of Bounded Balance
scientific article; zbMATH DE number 3557207 (Why is no real title available?)
scientific article; zbMATH DE number 3566230 (Why is no real title available?)
scientific article; zbMATH DE number 3571502 (Why is no real title available?)
scientific article; zbMATH DE number 3593565 (Why is no real title available?)
scientific article; zbMATH DE number 3423800 (Why is no real title available?)

Cited in

(only showing first 100 items - show all)

Bin packing with controllable item sizes
A linear time bin-packing algorithm
Convergence of optimal stochastic bin packing
Bin packing problems in one dimension: Heuristic solutions and confidence intervals
Online variable-sized bin packing
``A posteriori evaluation of bin packing approximation algorithms
Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
A class of simple stochastic online bin packing algorithms
A modular algorithm for an extended vehicle scheduling problem
Bin packing can be solved within 1+epsilon in linear time
An effective structured approach to finding optimal partitions of networks
Repacking helps in bounded space on-line bin-packing
Some simplified NP-complete graph problems
Resource constrained scheduling as generalized bin packing
Design of private backbone networks. II: Time varying grouped traffic
The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming
A hybrid genetic/optimization algorithm for a task allocation problem
Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
Heuristics for laying out information graphs
Multiple-type, two-dimensional bin packing problems: Applications and algorithms
Approximate algorithms for the \(P\parallel C_{\max}\) problem
Parametric on-line algorithms for packing rectangles and boxes.
Worst-case analysis of the subset sum algorithm for bin packing.
The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints
Optimal energy-efficient placement of virtual machines with divisible sizes
A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts
More on batched bin packing
Non-preemptive scheduling to maximize the minimum global inter-completion time
Heuristic methods and applications: A categorized survey
Assigning service requests in voice-over-internet gateway multiprocessors
Efficient heuristics for robot acquisition planning for a CIM system
A tight lower bound for optimal bin packing
Bridging gap between standard and differential polynomial approximation: The case of bin-packing
A 5/4 linear time bin packing algorithm
Best fit bin packing with random order revisited
Order acceptance for motorail transportation with uncertain parameters
A bin packing approach to solve the aircraft maintenance task allocation problem
Exact distributional analysis of online algorithms with lookahead
Comparing the costs of any fit algorithms for bin packing
Homogeneous grouping of non-prime steel products for online auctions: a case study
Open-end bin packing: new and old analysis approaches
Online bin packing with cardinality constraints resolved
Efficient 1-space bounded hypercube packing algorithm
Integrated production and delivery scheduling on a serial batch machine to minimize the makespan
Fully dynamic bin packing revisited
Online results for black and white bin packing
Offline black and white bin packing
Online bin packing with \((1,1)\) and \((2,R)\) bins
NF-based algorithms for online bin packing with buffer and bounded item size
Bin packing problem with scenarios
Drawer algorithms for 1-space bounded multidimensional hyperbox packing
Online bin packing of fragile objects with application in cellular networks
Online bin packing with resource augmentation
Bin packing with general cost structures
Improved results for a memory allocation problem
Comparing online algorithms for bin packing problems
Bounds for online bounded space hypercube packing
Average case analysis of bounded space bin packing algorithms
The class constrained bin packing problem with applications to video-on-demand
Online square and cube packing
Bounds for online bin packing with cardinality constraints
The partitioned dynamic-priority scheduling of sporadic task systems
Online two-dimensional vector packing with advice
Parallel online algorithms for the bin packing problem
NF-based algorithms for online bin packing with buffer and item size limitation
Online Bin Packing with (1,1) and (2,R) Bins
Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time
Algorithms for the two dimensional bin packing problem with partial conflicts
A survey on combinatorial optimization in dynamic environments
Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing
On a generalized bin-packing problem
A grouping genetic algorithm with controlled gene transmission for the bin packing problem
An AFPTAS for variable sized bin packing with general activation costs
On online bin packing with LIB constraints
A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
NP-Complete operations research problems and approximation algorithms
An algorithm for a class of loading problems
Approximation scheduling algorithms: a survey
Online variable-sized bin packing with conflicts
Relaxation techniques applied to some loading problems
New lower bounds for certain classes of bin packing algorithms
On the absolute approximation ratio for first fit and related results
Average-case analyses of first fit and random fit bin packing
A generalized exchange heuristic for the capacitated vehicle routing problem
On-line bin packing ? A restricted survey
Analysis of a first-fit algorithm for the capacitated unit covering problem
Fully-dynamic bin packing with little repacking
A new and improved algorithm for online bin packing
Best fit bin packing with random order revisited
Online bin packing problem with buffer and bounded size revisited
Fast approximation methods for online scheduling of outpatient procedure centers
On capacitated covering with unit balls
A multi-start tabu search based algorithm for solving the warehousing problem with conflict
Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
Performance of the LPT algorithm in multiprocessor scheduling
Adaptive Bin Packing with Overflow
Online bin packing of squares and cubes
A new lower bound for classic online bin packing
Several methods of analysis for cardinality constrained bin packing
Streaming algorithms for bin packing and vector scheduling

This page was built for publication: Fast algorithms for bin packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1845315)