Pages that link to "Item:Q1847185"
From MaRDI portal
The following pages link to Heuristics for the container loading problem (Q1847185):
Displaying 50 items.
- A heuristic for solving large bin packing problems in two and three dimensions (Q300728) (← links)
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry (Q319718) (← links)
- The disruptive anti-covering location problem (Q320083) (← links)
- The multiple container loading problem with preference (Q320625) (← links)
- A heuristic algorithm for container loading of pallets with infill boxes (Q322963) (← links)
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints (Q336326) (← links)
- An effective shaking procedure for 2D and 3D strip packing problems (Q336597) (← links)
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP (Q337416) (← links)
- The air-cargo consolidation problem with pivot weight: models and solution methods (Q337525) (← links)
- On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints (Q367235) (← links)
- Container packing problem with balance constraints (Q480768) (← links)
- A fast heuristic for a three-dimensional non-convex domain loading problem (Q538281) (← links)
- A novel hybrid tabu search approach to container loading (Q613519) (← links)
- A tree search method for the container loading problem with shipment priority (Q635159) (← links)
- Layer-layout-based heuristics for loading homogeneous items into a single container (Q926048) (← links)
- A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach (Q930941) (← links)
- A new heuristic algorithm for cuboids packing with no orientation constraints (Q954042) (← links)
- Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
- A least wasted first heuristic algorithm for the rectangular packing problem (Q960413) (← links)
- New lower bounds for bin packing problems with conflicts (Q976310) (← links)
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints (Q1038331) (← links)
- Three-dimensional bin packing problem with variable bin height (Q1039777) (← links)
- Heuristics for container loading of furniture (Q1044119) (← links)
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review (Q1730669) (← links)
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP (Q1761144) (← links)
- A global search framework for practical three-dimensional packing with variable carton orientations (Q1761175) (← links)
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint (Q1761795) (← links)
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem (Q1761945) (← links)
- Three-dimensional container loading models with cargo stability and load bearing constraints (Q1761946) (← links)
- A parallel multi-population biased random-key genetic algorithm for a container loading problem (Q1761962) (← links)
- A reference length approach for the 3D strip packing problem (Q1926699) (← links)
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem (Q1926951) (← links)
- Two-dimensional knapsack-block packing problem (Q1984921) (← links)
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm (Q2027076) (← links)
- A data-driven approach for mixed-case palletization with support (Q2168642) (← links)
- A beam search algorithm for the biobjective container loading problem (Q2184131) (← links)
- Neighborhood structures for the container loading problem: a VNS implementation (Q2267814) (← links)
- Three-stage heuristic algorithm for three-dimensional irregular packing problem (Q2284451) (← links)
- A two-phase approach for single container loading with weakly heterogeneous boxes (Q2312435) (← links)
- Constraints in container loading -- a state-of-the-art review (Q2355797) (← links)
- A caving degree approach for the single container loading problem (Q2378453) (← links)
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle (Q2387245) (← links)
- A note on ``Reducing the number of binary variables in cutting stock problems'' (Q2448139) (← links)
- A new heuristic recursive algorithm for the strip rectangular packing problem (Q2489283) (← links)
- Three-dimensional packing of items with limited load bearing strength (Q2569082) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- A heuristic for the three-dimensional strip packing problem (Q2643958) (← links)
- An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem (Q2654397) (← links)
- Weight distribution in container loading: a case study (Q2803266) (← links)
- A comparative review of 3D container loading algorithms (Q2803269) (← links)
