Fast algorithms for bin packing
From MaRDI portal
Publication:1845315
DOI10.1016/S0022-0000(74)80026-7zbMath0284.68023OpenAlexW2048905935WikidataQ89224911 ScholiaQ89224911MaRDI QIDQ1845315
Publication date: 1974
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(74)80026-7
Related Items
On-line bin packing ? A restricted survey, Equitable scheduling on a single machine, A Multi-start Tabu Search Based Algorithm for Solving the Warehousing Problem with Conflict, The cutting stock problem applied to the hardening process in an automotive spring factory, Relative Worst-Order Analysis: A Survey, Scheduling appointments online: the power of deferred decision-making, Priority-based bin packing with subset constraints, Unnamed Item, Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers, Fully-Dynamic Bin Packing with Little Repacking, Online bin packing of squares and cubes, Online bin packing of squares and cubes, A note on an open-end bin packing problem, Lower bounds for several online variants of bin packing, On-line scheduling of parallel jobs with runtime restrictions, Online algorithms for page replication in rings, A generalized exchange heuristic for the capacitated vehicle routing problem, 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, Analysis of a first-fit algorithm for the capacitated unit covering problem, Best Fit Bin Packing with Random Order Revisited, Several methods of analysis for cardinality constrained bin packing, On capacitated covering with unit balls, Adaptive Bin Packing with Overflow, Heuristics for laying out information graphs, Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time, Algorithmic analysis of priority-based bin packing, Algorithms for the two dimensional bin packing problem with partial conflicts, Multiple-type, two-dimensional bin packing problems: Applications and algorithms, Assigning service requests in voice-over-internet gateway multiprocessors, Bounds for online bin packing with cardinality constraints, The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints, A survey on combinatorial optimization in dynamic environments, Bin packing problems in one dimension: Heuristic solutions and confidence intervals, Bin packing with rejection revisited, Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing, The partitioned dynamic-priority scheduling of sporadic task systems, A grouping genetic algorithm with controlled gene transmission for the bin packing problem, Optimal energy-efficient placement of virtual machines with divisible sizes, An AFPTAS for variable sized bin packing with general activation costs, Homogeneous grouping of non-prime steel products for online auctions: a case study, Online variable-sized bin packing, Efficient heuristics for robot acquisition planning for a CIM system, Approximate algorithms for the \(P\parallel C_{\max}\) problem, Tight bounds for online class-constrained packing, Open-end bin packing: new and old analysis approaches, A tight lower bound for optimal bin packing, Two- and three-dimensional parametric packing, The relative worst-order ratio applied to paging, Online bin packing with cardinality constraints resolved, Bin packing problem with scenarios, ``A posteriori evaluation of bin packing approximation algorithms, An asymptotic competitive scheme for online bin packing, 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, Relaxation techniques applied to some loading problems, Parametric on-line algorithms for packing rectangles and boxes., Probabilistic analysis for simple one- and two-dimensional bin packing algorithms, Bin packing with general cost structures, Improved results for a memory allocation problem, Online variable-sized bin packing with conflicts, Online two-dimensional vector packing with advice, Comparing online algorithms for bin packing problems, Efficient 1-space bounded hypercube packing algorithm, New lower bounds for certain classes of bin packing algorithms, On the absolute approximation ratio for first fit and related results, A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts, Parallel online algorithms for the bin packing problem, Worst-case analysis of the subset sum algorithm for bin packing., 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, 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, Bounds for online bounded space hypercube packing, Online bin packing problem with buffer and bounded size revisited, Average-case analyses of first fit and random fit bin packing, Average case analysis of bounded space bin packing algorithms, More on online bin packing with two item sizes, Best \(k\)-fit bin packing, An on-line algorithm for multidimensional bin packing, The class constrained bin packing problem with applications to video-on-demand, On a generalized bin-packing problem, Repacking helps in bounded space on-line bin-packing, Integrated production and delivery scheduling on a serial batch machine to minimize the makespan, Resource augmented semi-online bounded space bin packing, Scheduling jobs on grid processors, Tight results for next fit and worst fit with resource augmentation, Order acceptance for motorail transportation with uncertain parameters, Two-dimensional online bin packing with rotation, Some simplified NP-complete graph problems, Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem, Performance of the LPT algorithm in multiprocessor scheduling, More on batched bin packing, A bin packing approach to solve the aircraft maintenance task allocation problem, Resource constrained scheduling as generalized bin packing, Fully dynamic bin packing revisited, Bin packing with controllable item sizes, Exact distributional analysis of online algorithms with lookahead, Design of private backbone networks. II: Time varying grouped traffic, Non-preemptive scheduling to maximize the minimum global inter-completion time, NP-Complete operations research problems and approximation algorithms, An algorithm for a class of loading problems, Heuristic methods and applications: A categorized survey, On online bin packing with LIB constraints, Approximation scheduling algorithms: a survey, The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming, A hybrid genetic/optimization algorithm for a task allocation problem, Online square and cube packing, Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions, A storage-size selection problem, Online results for black and white bin packing, Comparing the costs of any fit algorithms for bin packing, A linear time bin-packing algorithm, Convergence of optimal stochastic bin packing, NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation, Online Bin Packing with (1,1) and (2,R) Bins, 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, A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
Cites Work
