Pages that link to "Item:Q1129950"
From MaRDI portal
The following pages link to An analytical model for the container loading problem (Q1129950):
Displayed 50 items.
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry (Q319718) (← links)
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems (Q336709) (← links)
- Models and algorithms for packing rectangles into the smallest square (Q342053) (← links)
- A space-indexed formulation of packing boxes into a larger box (Q433833) (← links)
- The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
- A fast heuristic for a three-dimensional non-convex domain loading problem (Q538281) (← links)
- An exact method for the 2D guillotine strip packing problem (Q606187) (← links)
- A novel hybrid tabu search approach to container loading (Q613519) (← links)
- A new heuristic algorithm for rectangle packing (Q883288) (← links)
- A particular approach for the three-dimensional packing problem with additional constraints (Q976016) (← links)
- Multi-dimensional bin packing problems with guillotine constraints (Q976021) (← links)
- MIP-based heuristic for non-standard 3D-packing problems (Q1029557) (← links)
- Three-dimensional bin packing problem with variable bin height (Q1039777) (← links)
- A global optimization algorithm for the three-dimensional packing problem (Q1584791) (← links)
- A MIP-based slicing heuristic for three-dimensional bin packing (Q1686545) (← links)
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates (Q1754152) (← links)
- A new load balance methodology for container loading problem in road transportation (Q1754193) (← links)
- A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints (Q1754206) (← links)
- A global search framework for practical three-dimensional packing with variable carton orientations (Q1761175) (← links)
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts (Q1761944) (← links)
- Three-dimensional container loading models with cargo stability and load bearing constraints (Q1761946) (← links)
- Heuristics for the container loading problem (Q1847185) (← links)
- Two-dimensional packing problems: a survey (Q1847188) (← links)
- An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container (Q1847196) (← links)
- Transshipment of containers at a container terminal: An overview (Q1869526) (← links)
- A global optimization point of view to handle non-standard object packing problems (Q1941035) (← links)
- A review of deterministic optimization methods in engineering and management (Q1955154) (← links)
- Solving packing problems by a distributed global optimization algorithm (Q1955364) (← links)
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems (Q2003558) (← links)
- The pallet loading problem: three-dimensional bin packing with practical constraints (Q2023993) (← links)
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm (Q2027076) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- Methodology for selecting packaging alternatives: an ``action research'' application in the industrial sector (Q2053001) (← links)
- A data-driven approach for mixed-case palletization with support (Q2168642) (← links)
- Lower bounds for three-dimensional multiple-bin-size bin packing problems (Q2260892) (← links)
- Three-stage heuristic algorithm for three-dimensional irregular packing problem (Q2284451) (← links)
- The exact solutions of several types of container loading problems (Q2301942) (← links)
- Deterministic model for customized pilot manufacture production with various backplane sizes (Q2310672) (← links)
- Constraints in container loading -- a state-of-the-art review (Q2355797) (← links)
- Exact and approximate methods for parallel multiple-area spatial scheduling with release times (Q2393121) (← links)
- An optimization model for storage yard management in transshipment hubs (Q2432102) (← links)
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem (Q2566944) (← links)
- The two-dimensional bin packing problem with variable bin sizes and costs (Q2568334) (← links)
- Solving the 3-D yard allocation problem for break bulk cargo via variable neighborhood search branching (Q2631277) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem (Q2643948) (← links)
- A 3D-BPP approach for optimising stowage plans and terminal productivity (Q2643974) (← links)
- A matheuristic framework for the three-dimensional single large object placement problem with practical constraints (Q2664409) (← links)
- Reinforcement learning for combinatorial optimization: a survey (Q2669503) (← links)
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561) (← links)