New classes of fast lower bounds for bin packing problems
From MaRDI portal
Recommendations
Cited in
(71)- Bidimensional packing by bilinear programming
- New lower bounds based on column generation and constraint programming for the pattern minimization problem
- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure
- On the two-dimensional knapsack problem
- A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts
- A branch, bound, and remember algorithm for the simple disassembly line balancing problem
- Lower bounds for a bin packing problem with linear usage cost
- LP bounds in various constraint programming approaches for orthogonal packing
- A cutting plane approach for integrated planning and scheduling
- Fast approximate PCPs for multidimensional bin-packing problems
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
- An improved lower bound for the bin packing problem
- A tight lower bound for optimal bin packing
- Worst-case analysis of maximal dual feasible functions
- Conservative scales in packing problems
- Bin packing problem with conflicts and item fragmentation
- Exact solution techniques for two-dimensional cutting and packing
- Solving bin packing problems using VRPSolver models
- Lower bounds for three-dimensional multiple-bin-size bin packing problems
- Deterministic model for customized pilot manufacture production with various backplane sizes
- A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
- Solving the one-dimensional bin packing problem with a weight annealing heuristic
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- 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
- A new exact method for the two-dimensional orthogonal packing problem
- Computing the asymptotic worst-case of bin packing lower bounds
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- A linear programming approach for the three-dimensional bin-packing problem
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
- New Lower Bounds for Certain Classes of Bin Packing Algorithms
- New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem
- A branch-and-price-and-cut algorithm for the pattern minimization problem
- Online Square Packing
- 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
- 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
- scientific article; zbMATH DE number 1187157 (Why is no real title available?)
- On the extremality of maximal dual feasible functions
- The three-dimensional knapsack problem with balancing constraints
- New lower bounds for certain classes of bin packing algorithms
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
- Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem
- Using dual feasible functions to construct fast lower bounds for routing and location problems
- Packing disks into disks with optimal worst-case density
- Fast approximation methods for online scheduling of outpatient procedure centers
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
- A multi-start tabu search based algorithm for solving the warehousing problem with conflict
- Consecutive ones matrices for multi-dimensional orthogonal packing problems
- A new lower bound for classic online bin packing
- 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 large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
- A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem
- Chance-constrained stochastic assembly line balancing with branch, bound and remember algorithm
- A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem
- Algorithms for the bin packing problem with scenarios
- Flight test scheduling: a generic model, lower bounds, and iterated local search
- Last fifty years of integer linear programming: a focus on recent practical advances
- Packing squares into a disk with optimal worst-case density
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
- New bin packing fast lower bounds
- Lower bounds and reduction procedures for the bin packing problem
- Theoretical investigations on maximal dual feasible functions
- New lower bounds for bin packing problems with conflicts
This page was built for publication: New classes of fast lower bounds for bin packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5955558)
