The exact solutions of several types of container loading problems
From MaRDI portal
Publication:2301942
Recommendations
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
- An Efficient Algorithm for Solving the Container Loading Problem
- Approximate algorithms for the container loading problem
- A heuristic for multiple container loading problems
- An analytical model for the container loading problem
- Solving container loading problems by block arrangement
- The multiple container loading cost minimization problem
- Loading problem in multiple containers and pallets using strategic search method
- Heuristics for the container loading problem
Cites work
- A beam search approach to the container loading problem
- A bottleneck assignment approach to the multiple container loading problem
- A comparative review of 3D container loading algorithms
- A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- A greedy search for the three-dimensional bin packing problem: the packing static stability case
- A heuristic algorithm for container loading of pallets with infill boxes
- A heuristic for multiple container loading problems
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- A hybrid placement strategy for the three-dimensional strip packing problem
- A MIP-based slicing heuristic for three-dimensional bin packing
- A new load balance methodology for container loading problem in road transportation
- A particular approach for the three-dimensional packing problem with additional constraints
- A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions
- A prototype column generation strategy for the multiple container loading problem
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
- An Algorithm for Two-Dimensional Cutting Problems
- An analytical model for the container loading problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An improved typology of cutting and packing problems
- Approximate algorithms for the container loading problem
- Constraints in container loading -- a state-of-the-art review
- scientific article; zbMATH DE number 4074379 (Why is no real title available?)
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- Solving a large multicontainer loading problem in the car manufacturing industry
- Solving container loading problems by block arrangement
- The G4-Heuristic for the Pallet Loading Problem
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- The multiple container loading cost minimization problem
- The multiple container loading problem with preference
- The Three-Dimensional Bin Packing Problem
- Three-dimensional container loading models with cargo stability and load bearing constraints
- Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
- VCS: A new heuristic function for selecting boxes in the single container loading problem
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
Cited in
(26)- An analytical model for the container loading problem
- Three-dimensional container loading models with cargo stability and load bearing constraints
- A bottleneck assignment approach to the multiple container loading problem
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
- Modeling and solving the waste valorization production and distribution scheduling problem
- A caving degree approach for the single container loading problem
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container
- Weight distribution in container loading: a case study
- AUTOPACK - algorithms for automated container loading
- A container loading problem MILP-based heuristics solved by CPLEX: an experimental analysis
- Optimization models for the three-dimensional container loading problem with practical constraints
- An efficient method for the three-dimensional container loading problem by forming box sizes
- A large neighbourhood search algorithm for solving container loading problems
- The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices
- The multiple container loading problem with loading docks
- The multiple container loading cost minimization problem
- A two-phase constructive algorithm for the single container mix-loading problem
- Mathematical modeling and heuristic solutions for container loading and routing problem: a case study in a cable manufacturing company
- A block-building constraint programming model for the container loading problem
- Mathematical models and heuristic algorithms for pallet building problems with practical constraints
- Static stability versus packing efficiency in online three-dimensional packing problems: a new approach and a computational study
- The semi-online robotic pallet loading problem
- A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints
- Solving a large-scale 3D packing problem with robot constraints
- A tree search-based heuristic for the three-dimensional single container loading problem
- Logistic constraints in container loading problems: the impact of complete shipment conditions
This page was built for publication: The exact solutions of several types of container loading problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301942)
