Toward a unified approach for the classification of NP-complete optimization problems (Q1143789): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4133133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3920645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4161330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4125769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic evaluation techniques for bin packing approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the Quality of Approximate Solutions to Zero-One Programming Problems / rank
 
Normal rank

Latest revision as of 10:12, 13 June 2024

scientific article
Language Label Description Also known as
English
Toward a unified approach for the classification of NP-complete optimization problems
scientific article

    Statements

    Toward a unified approach for the classification of NP-complete optimization problems (English)
    0 references
    0 references
    0 references
    1980
    0 references
    0 references
    NP-complete optimization
    0 references
    approximation
    0 references
    0 references