New classes of fast lower bounds for bin packing problems
From MaRDI portal
Publication:5955558
DOI10.1007/s101070100243zbMath1051.90020OpenAlexW2399594521MaRDI QIDQ5955558
Sándor P. Fekete, Jörg Schepers
Publication date: 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070100243
Related Items
A branch-and-price-and-cut algorithm for the pattern minimization problem, Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem, A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes, Procedures for the bin packing problem with precedence constraints, Bin packing and cutting stock problems: mathematical models and exact algorithms, Online Square Packing, A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem, A new exact method for the two-dimensional orthogonal packing problem, Computing the asymptotic worst-case of bin packing lower bounds, An effective tabu search approach with improved loading algorithms for the 3L-CVRP, Unsplittable non-additive capacitated network design using set functions polyhedra, Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing, Arc-flow model for the two-dimensional guillotine cutting stock problem, New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation, A three-dimensional bin-packing model: exact multicriteria solution and computational complexity, Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem, New bin packing fast lower bounds, Worst-case analysis of maximal dual feasible functions, A new destructive bounding scheme for the bin packing problem, A survey of dual-feasible and superadditive functions, The off-line group seat reservation problem, A Multi-start Tabu Search Based Algorithm for Solving the Warehousing Problem with Conflict, A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts, Conservative scales in packing problems, A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem, On the extremality of maximal dual feasible functions, The three-dimensional knapsack problem with balancing constraints, A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts, Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers, A branch, bound, and remember algorithm for the simple disassembly line balancing problem, On the two-dimensional knapsack problem, Using dual feasible functions to construct fast lower bounds for routing and location problems, Solving the one-dimensional bin packing problem with a weight annealing heuristic, Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem, LP bounds in various constraint programming approaches for orthogonal packing, A cutting plane approach for integrated planning and scheduling, Lower bounds for three-dimensional multiple-bin-size bin packing problems, Theoretical investigations on maximal dual feasible functions, New lower bounds for bin packing problems with conflicts, Unnamed Item, A generic view of Dantzig--Wolfe decomposition in mixed integer programming, Unnamed Item, Bin packing problem with conflicts and item fragmentation, Exact solution techniques for two-dimensional cutting and packing, Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows, Solving bin packing problems using VRPSolver models, Consecutive ones matrices for multi-dimensional orthogonal packing problems, Bidimensional packing by bilinear programming, New lower bounds based on column generation and constraint programming for the pattern minimization problem, Deterministic model for customized pilot manufacture production with various backplane sizes, Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem, Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure, The two-dimensional bin packing problem with variable bin sizes and costs, State-of-the-art exact and heuristic solution procedures for simple assembly line balancing, Fast lifting procedures for the bin packing problem
Uses Software
