Lower bounds and reduction procedures for the bin packing problem
From MaRDI portal
Publication:917446
DOI10.1016/0166-218X(90)90094-SzbMath0704.90074MaRDI QIDQ917446
Publication date: 1990
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Improved filtering for the bin-packing with cardinality constraint, An analysis of lower bound procedures for the bin packing problem, Bin packing and cutting stock problems: mathematical models and exact algorithms, Computing redundant resources for the resource constrained project scheduling problem, Computing the asymptotic worst-case of bin packing lower bounds, Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools, A grouping genetic algorithm with controlled gene transmission for the bin packing problem, BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem, Unsplittable non-additive capacitated network design using set functions polyhedra, Improved lower bounds for the online bin stretching problem, New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation, A virtual microstructure generator for 3D stone masonry walls, An improved lower bound for the bin packing problem, A three-dimensional bin-packing model: exact multicriteria solution and computational complexity, Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation, An exact method for the 2D guillotine strip packing problem, Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem, New bin packing fast lower bounds, Reinforcement learning for combinatorial optimization: a survey, Optimal rectangle packing, Exact and approximate methods for the score-constrained packing problem, The off-line group seat reservation problem, Redundant cumulative constraints to compute preemptive bounds, The two-echelon stochastic multi-period capacitated location-routing problem, A two-stage stochastic location-routing problem for electric vehicles fast charging, On linear lower bounds for the resource constrained project scheduling problem., Upper bounds and algorithms for the maximum cardinality bin packing problem., Electric vehicles fast charger location-routing problem under ambient temperature, An investigation into two bin packing problems with ordering and orientation implications, A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem, A simulated annealing hyper-heuristic methodology for flexible decision support, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers, A particle swarm optimizer for grouping problems, A sequential value correction heuristic for a bi-objective two-dimensional bin-packing, SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing, Branch-and-bound algorithms for the multi-product assembly line balancing problem, Lower bounds for a bin packing problem with linear usage cost, Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date considerations, Energy efficient spatial TDMA scheduling in wireless networks, A cutting plane approach for integrated planning and scheduling, Heuristics and lower bounds for the bin packing problem with conflicts, Grouping evolution strategies: an effective approach for grouping problems, Lower bounds and algorithms for the 2-dimensional vector packing problem, Bounds for the cardinality constrained \(P \|C_{max}\) problem, An exact algorithm for the type-constrained and variable sized bin packing problem, New symmetry-less ILP formulation for the classical one dimensional bin-packing problem, Bin packing problem with conflicts and item fragmentation, Exact solution techniques for two-dimensional cutting and packing, A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing, Bidimensional packing by bilinear programming, Two heuristics for the one-dimensional bin-packing problem, Auxiliary tool allocation in flexible manufacturing systems, Properties of some ILP formulations of a class of partitioning problems, Benders Decomposition for Capacitated Network Design, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
Cites Work
