The Three-Dimensional Bin Packing Problem
From MaRDI portal
Publication:4530648
Recommendations
- New lower bounds for the three-dimensional finite bin packing problem
- scientific article; zbMATH DE number 21364
- Guided local search for the three-dimensional bin-packing problem
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
- On Three-Dimensional Packing
Cited in
(only showing first 100 items - show all)- Minimal surface convex hulls of spheres
- Efficient algorithms for orthogonal packing problems
- Fuzzy bin packing problem.
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
- A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- Lower bounds for three-dimensional multiple-bin-size bin packing problems
- A comparative review of 3D container loading algorithms
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
- Logistic constraints in container loading problems: the impact of complete shipment conditions
- Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
- An open space based heuristic for the 2D strip packing problem with unloading constraints
- Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints
- A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
- A MIP-based slicing heuristic for three-dimensional bin packing
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
- An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
- The forgotten sons: warehousing systems for brick-and-mortar retail chains
- Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
- New lower bounds for the three-dimensional orthogonal bin packing problem
- A global search framework for practical three-dimensional packing with variable carton orientations
- A particular approach for the three-dimensional packing problem with additional constraints
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
- A new search procedure for the two-dimensional orthogonal packing problem
- Incremental bin packing
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning
- The exact solutions of several types of container loading problems
- A linear programming approach for the three-dimensional bin-packing problem
- Stabilized branch-and-price algorithms for vector packing problems
- A global optimization point of view to handle non-standard object packing problems
- Irreducible bin packing and normality in routing open shop
- Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques
- Modeling soft unloading constraints in the multi-drop container loading problem
- Sequential heuristic for the two-dimensional bin-packing problem
- BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem
- Product packing and stacking under uncertainty: a robust approach
- Three-stage heuristic algorithm for three-dimensional irregular packing problem
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Multi-objective optimization of the 3D container stowage planning problem in a barge convoy system
- scientific article; zbMATH DE number 4112059 (Why is no real title available?)
- Predicting packaging sizes using machine learning
- A data-driven approach for mixed-case palletization with support
- Vehicle routing with private and shared delivery locations
- A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension
- The multiple container loading problem with loading docks
- Trolley optimisation for loading printed circuit board components
- Packing problems in space solved by CPLEX: an experimental analysis
- A three-dimensional bin packing problem with item fragmentation and its application in the storage location assignment problem
- Airfreight forwarder's shipment planning: shipment consolidation and containerization
- On the hardness of palletizing bins using FIFO queues
- Quick and situ-aware spatiotemporal scheduling for shipbuilding manufacturing
- Using a Bin Packing Approach for Stowing Hazardous Containers into Containerships
- Data structures for higher-dimensional rectilinear packing
- A Branch-and-Repair Method for Three-Dimensional Bin Selection and Packing in E-Commerce
- A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
- A two-phase constructive algorithm for the single container mix-loading problem
- Exploiting packing components in general-purpose integer programming solvers
- The two dimensional bin packing problem with side constraints
- Guided local search for the three-dimensional bin-packing problem
- Optimal rectangle packing
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
- The two-dimensional bin packing problem with variable bin sizes and costs
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- Models and algorithms for packing rectangles into the smallest square
- The load-balanced multi-dimensional bin-packing problem
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- Extreme point-based heuristics for three-dimensional bin packing
- Routing problems with loading constraints
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- Three-dimensional container loading models with cargo stability and load bearing constraints
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- New lower bound and exact method for the continuous berth allocation problem
- Heuristic algorithms for the three-dimensional bin packing problem
- A least wasted first heuristic algorithm for the rectangular packing problem
- The multiple container loading cost minimization problem
- Space and time allocation in a shipyard assembly hall
- Constraints in container loading -- a state-of-the-art review
- Bidimensional packing by bilinear programming
- A 3D-BPP approach for optimising stowage plans and terminal productivity
- On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints
- Multi-dimensional bin packing problems with guillotine constraints
- Corner occupying theorem for the two-dimensional integral rectangle packing problem
- A branch and bound algorithm for the strip packing problem
- TSpack: A unified tabu search code for multi-dimensional bin packing problems
- MIP-based heuristic for non-standard 3D-packing problems
- Model development and optimization for space engineering: concepts, tools, applications, and perspectives
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A heuristic for solving large bin packing problems in two and three dimensions
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Two-dimensional packing problems: a survey
- A greedy search for the three-dimensional bin packing problem: the packing static stability case
- Three-dimensional bin packing problem with variable bin height
- A lower bound for the non-oriented two-dimensional bin packing problem
This page was built for publication: The Three-Dimensional Bin Packing Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530648)
