A moment based metric for 2-D and 3-D packing (Q1971998): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: Q3716813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact methods for the knapsack problem and its generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multiple Knapsack Problems by Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest path algorithms for knapsack type problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compaction and separation algorithms for non-convex polygons and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4303979 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 15:03, 29 May 2024

scientific article
Language Label Description Also known as
English
A moment based metric for 2-D and 3-D packing
scientific article

    Statements

    A moment based metric for 2-D and 3-D packing (English)
    0 references
    0 references
    0 references
    23 March 2000
    0 references
    0 references
    multidimensional packing
    0 references
    optimization
    0 references
    packing metrics
    0 references