Solving a cutting-stock problem with the constraint logic programming language CHIP (Q1197095): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(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: Solving a cutting-stock problem with the constraint logic programming language CHIP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une étude pratique de découpes de panneaux de bois / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Boolean expressions into logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214706 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0895-7177(92)90081-u / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074782926 / rank
 
Normal rank

Latest revision as of 10:07, 30 July 2024

scientific article
Language Label Description Also known as
English
Solving a cutting-stock problem with the constraint logic programming language CHIP
scientific article

    Statements

    Solving a cutting-stock problem with the constraint logic programming language CHIP (English)
    0 references
    16 January 1993
    0 references
    0 references
    logic programming language
    0 references
    two-dimensional cutting stock problem
    0 references
    CHIP
    0 references
    0 references
    0 references
    0 references
    0 references