An AND/OR-graph approach to the container loading problem
From MaRDI portal
Recommendations
Cited in
(38)- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- An efficient approach for the multi-pallet loading problem
- Solving a large multicontainer loading problem in the car manufacturing industry
- MIP-based approaches for the container loading problem with multi-drop constraints
- Three-dimensional container loading models with cargo stability and load bearing constraints
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- Heuristics for the container loading problem
- Solving container loading problems by block arrangement
- An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container
- A bottleneck assignment approach to the multiple container loading problem
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- Neighborhood structures for the container loading problem: a VNS implementation
- A two-phase approach for single container loading with weakly heterogeneous boxes
- Constraints in container loading -- a state-of-the-art review
- A caving degree approach for the single container loading problem
- A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- The pallet loading problem: a review of solution methods and computational experiments
- Weight distribution in container loading: a case study
- A comparative review of 3D container loading algorithms
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- On the three-dimensional container packing problem under home delivery service
- The multiple container loading problem with preference
- A heuristic algorithm for container loading of pallets with infill boxes
- A beam search approach to the container loading problem
- On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints
- Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem
- Optimization models for the three-dimensional container loading problem with practical constraints
- Analysing trade-offs in container loading: combining load plan construction heuristics with agent-based simulation
- A hybrid genetic algorithm for the container loading problem
- Systematic reviews as a metaknowledge tool: caveats and a review of available options
- Exact algorithms for the product configuration problem
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- Solution validator and visualizer for (combined) vehicle routing and container loading problems
- A two-phase constructive algorithm for the single container mix-loading problem
- A tree search-based heuristic for the three-dimensional single container loading problem
This page was built for publication: An AND/OR-graph approach to the container loading problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4888228)
