A moment based metric for 2-D and 3-D packing

DOI10.1016/S0377-2217(99)00061-2zbMATH Open0961.90085OpenAlexW2159617587MaRDI QIDQ1971998FDOQ1971998

Authors: John K. Dickinson, George K. Knopf 

Publication date: 23 March 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00061-2

Recommendations

• A global optimization algorithm for the three-dimensional packing problem
• Optimal packing using the multiple mating method
• scientific article; zbMATH DE number 3990764
• On Three-Dimensional Packing
• The method of artificial space dilation in problems of optimal packing of geometric objects

zbMATH Keywords

optimizationmultidimensional packingpacking metrics

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Compaction and separation algorithms for non-convex polygons and their applications
• A typology of cutting and packing problems
• Packing problems
• Exact methods for the knapsack problem and its generalizations
• Shortest path algorithms for knapsack type problems
• Solving Multiple Knapsack Problems by Cutting Planes
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Translational packing of arbitrary polytopes

This page was built for publication: A moment based metric for 2-D and 3-D packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1971998)