An optimal algorithm for rectangle placement (Q1306372): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127149144, #quickstatements; #temporary_batch_1721934265115
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the largest rectangle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some experiments with simulated annealing techniques for packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Local Optimization-based Solution to the Rectangle Layout Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for the largest empty rectangle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127149144 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:05, 25 July 2024

scientific article
Language Label Description Also known as
English
An optimal algorithm for rectangle placement
scientific article

    Statements

    An optimal algorithm for rectangle placement (English)
    0 references
    0 references
    0 references
    0 references
    20 March 2001
    0 references
    rectangle placement
    0 references
    two-dimensional knapsack
    0 references
    VLSI layout
    0 references

    Identifiers