An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container (Q1847196)

From MaRDI portal
Revision as of 08:32, 24 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57719570, #quickstatements; #temporary_batch_1706081078495)
scientific article
Language Label Description Also known as
English
An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
scientific article

    Statements

    An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container (English)
    0 references
    0 references
    17 November 2002
    0 references
    3-dimensional packing
    0 references
    Pallet/container loading
    0 references
    Combinatorial optimization
    0 references
    Graph theory
    0 references

    Identifiers