Load planning for shipments of low density products
From MaRDI portal
Publication:1825772
DOI10.1016/0377-2217(90)90364-HzbMath0684.90085OpenAlexW2027658003MaRDI QIDQ1825772
Robert W. Haessler, F. Brian Talbot
Publication date: 1990
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(90)90364-h
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem, Solving a large multicontainer loading problem in the car manufacturing industry, An analytical model for the container loading problem, Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study, Packing problems, A new load balance methodology for container loading problem in road transportation, MIP-based approaches for the container loading problem with multi-drop constraints, A Genetic Algorithm for Solving the Container Loading Problem, Weight distribution in container loading: a case study, A comparative review of 3D container loading algorithms, A two-phase approach for single container loading with weakly heterogeneous boxes, A typology of cutting and packing problems, A global optimization algorithm for the three-dimensional packing problem, An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container, Constraints in container loading -- a state-of-the-art review
Cites Work
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An Algorithm for Two-Dimensional Cutting Problems
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem