Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped (Q466345): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10559-010-9260-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077371707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of the application of meta-heuristic algorithms to 2D strip packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New heuristic and interactive approaches to 2D rectangular strip packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5467296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3734166 / rank
 
Normal rank

Latest revision as of 04:54, 9 July 2024

scientific article
Language Label Description Also known as
English
Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped
scientific article

    Statements

    Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 October 2014
    0 references
    mathematical modeling
    0 references
    optimization
    0 references
    packing
    0 references
    \(n\)-dimensional parallelepiped
    0 references
    \(\Phi\)-function
    0 references
    NP-difficult problem
    0 references

    Identifiers