Optimal wafer cutting in shuttle layout problems (Q719028): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58826384, #quickstatements; #temporary_batch_1706897434465
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/s10878-009-9284-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2127273143 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chips on wafers, or packing rectangles into grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Maximum Weight Clique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank

Latest revision as of 12:17, 4 July 2024

scientific article
Language Label Description Also known as
English
Optimal wafer cutting in shuttle layout problems
scientific article

    Statements

    Optimal wafer cutting in shuttle layout problems (English)
    0 references
    0 references
    0 references
    0 references
    27 September 2011
    0 references
    0 references
    semiconductor layout problem
    0 references
    cutting problem
    0 references
    column generation
    0 references
    vertex-weighted clique problem
    0 references
    0 references
    0 references