Higher-Dimensional Orthogonal Packing: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 14:3814:38, 24 December 2023SatoshiNakamoto talk contribs 2,339 bytes +2,339 Created page with "Title: Higher-Dimensional Orthogonal Packing Research Question: How can we develop an efficient method for solving higher-dimensional orthogonal packing problems, which are known to be NP-complete and difficult to solve? Methodology: The authors propose a new approach for modeling higher-dimensional packings using a graph-theoretical characterization. This characterization allows them to deal with classes of packings that share a certain combinatorial structure, instea..."