Publication:3347319

Michael R. Garey, David S. Johnson, Edward G. jun. Coffman

Publication date: 1984

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Combinatorial aspects of packing and covering (05B40) Discrete mathematics in relation to computer science (68R99) Bibliographies for mathematics in general (00A15)

Related Items

Prospective Network Flow Models and Algorithms for Bin Packing Problems, Algorithms for the two dimensional bin packing problem with partial conflicts, Integrated scheduling on parallel batch processing machines with non-identical capacities, FFD bin packing for item sizes with uniform distributions on \([0,\frac12\).], A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem, A note on the approximability of cutting stock problems, Black and White Bin Packing Revisited, Compact integer linear programming formulations for the temporal bin packing problem with fire-ups, Exact and approximate methods for the score-constrained packing problem, An introduction to the two‐dimensional rectangular cutting and packing problem, The bin covering with delivery problem, extended investigations for the online case, A Large Neighbourhood Search Heuristic for a Periodic Supply Vessel Planning Problem Arising in Offshore Oil and Gas Operations, Determining the Minimum Number of Warehouses and their Space-Size for Storing Compatible Items, Selfish Bin Packing, Modeling and Solving the Capacitated Vehicle Routing Problem on Trees, Lower bounds and algorithms for the 2-dimensional vector packing problem, Minimum Weighted Sum Bin Packing, The peak load minimization problem in cyclic production, On-line bin-stretching, Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure, Better Bin Packing Approximations via Discrepancy Theory, Unnamed Item, Fast lifting procedures for the bin packing problem, Online Bin Packing with (1,1) and (2,R) Bins, A 71/60 theorem for bin packing, Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time, Multiple-type, two-dimensional bin packing problems: Applications and algorithms, A 13/12 approximation algorithm for bin packing with extendable bins, An analysis of lower bound procedures for the bin packing problem, Ranking lower bounds for the bin-packing problem, An exact algorithm for the dual bin packing problem, Sequential vector packing, On the worst-case ratio of a compound multiprocessor scheduling algorithm, Bin packing problems in one dimension: Heuristic solutions and confidence intervals, An introduction to stochastic bin packing-based server consolidation with conflicts, Bin packing with rejection revisited, Bin packing and cutting stock problems: mathematical models and exact algorithms, The average-case analysis of some on-line algorithms for bin packing, Bin packing with divisible item sizes, Routing and wavelength assignment in optical networks using bin packing based algorithms, Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times, Exhaustive approaches to 2D rectangular perfect packings, Resource constrained scheduling on multiple machines, BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem, Online variable-sized bin packing, Optimization of roll cutting in clothing industry, Approximate algorithms for the \(P\parallel C_{\max}\) problem, Anomalous behavior in bin packing algorithms, Heuristic approaches for batching jobs in printed circuit board assembly, A note on worst-case performance of heuristics for maintenance scheduling problems, Mean-variance approach to the management of cyclic deliveries, Approximation and online algorithms for multidimensional bin packing: a survey, An improved lower bound for the bin packing problem, Average-case analysis of the smart next fit algorithm, Scheduling jobs on a single machine with periodic release date/deadline intervals, Probabilistic analysis of a bin covering algorithm, Two- and three-dimensional parametric packing, Multidimensional on-line bin packing: Algorithms and worst-case analysis, A sequential heuristic procedure for one-dimensional cutting, Solution approaches to irregular nesting problems, Bounds for nested knapsack problems, Space and time allocation in a shipyard assembly hall, Selfish bin packing with cardinality constraints, An exact algorithm for general, orthogonal, two-dimensional knapsack problems, A hybrid placement strategy for the three-dimensional strip packing problem, A study on load-balanced variants of the bin packing problem, Cube packing., Online bin packing with resource augmentation, Parametric on-line algorithms for packing rectangles and boxes., Bin packing with general cost structures, Online variable-sized bin packing with conflicts, Performance evaluation of OpenMP-based algorithms for handling Kronecker descriptors, Lower bounds and reduction procedures for the bin packing problem, A state-of-the-art review of parallel-machine scheduling research, Two-dimensional packing with conflicts, Improved bounds for harmonic-based bin packing algorithms, A fundamental restriction on fully dynamic maintenance of bin packing, A new version of on-line variable-sized bin packing, Approximation algorithms for time constrained scheduling, BPPLIB: a library for bin packing and cutting stock problems, Branch-and-bound algorithms for the multi-product assembly line balancing problem, Oriented aligned rectangle packing problem, Packing problems, Selfish bin packing, New resolution algorithm and pretreatments for the two-dimensional bin-packing problem, The min-conflict packing problem, Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts, Class constrained bin covering, Heuristics and lower bounds for the bin packing problem with conflicts, An asymptotic 98.5\%-effective lower bound on fixed partition policies for the inventory-routing problem, New lower bounds for bin packing problems with conflicts, The evolution of a spatial stochastic network, A two-phase heuristic for strip packing: Algorithm and probabilistic analysis, Bin packing problem with conflicts and item fragmentation, Performance of the LPT algorithm in multiprocessor scheduling, Bin packing with controllable item sizes, A robust APTAS for the classical bin packing problem, Hardness of lazy packing and covering, Scheduling with a minimum number of machines, Minimising bins in transmission systems, A hybrid approach for optimization of one-dimensional cutting, Three-dimensional packings with rotations, On genetic algorithms for the packing of polygons, Auxiliary tool allocation in flexible manufacturing systems, Variable sized online interval coloring with bandwidth, Bin packing with restricted piece sizes, Average-case analysis of the modified harmonic algorithm, A one-dimensional cutting stock problem in the aluminium industry and its solution, A typology of cutting and packing problems, New lower bounds for the three-dimensional finite bin packing problem, A survey of scheduling with parallel batch (p-batch) processing, Techniques and results on approximation algorithms for packing circles, The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming, New directions in scheduling theory, Approximate and exact algorithms for the fixed-charge knapsack problem, An algorithm for polygon placement using a bottom-left strategy, An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem, Two-dimensional packing algorithms for layout of disconnected graphs, A branch-and-bound algorithm for the two-dimensional vector packing problem, A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective, Algorithms for the variable sized bin packing problem, The tight absolute bound of First Fit in the parameterized case, Bin-packing by simulated annealing, A bin packing problem with over-sized items