Combinatorial optimization problems with uncertain costs and the OWA criterion (Q482291): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6382141 / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial optimization
Property / zbMATH Keywords: combinatorial optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
OWA operator
Property / zbMATH Keywords: OWA operator / rank
 
Normal rank
Property / zbMATH Keywords
 
robust optimization
Property / zbMATH Keywords: robust optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank

Revision as of 20:36, 30 June 2023

scientific article
Language Label Description Also known as
English
Combinatorial optimization problems with uncertain costs and the OWA criterion
scientific article

    Statements

    Combinatorial optimization problems with uncertain costs and the OWA criterion (English)
    0 references
    0 references
    0 references
    22 December 2014
    0 references
    combinatorial optimization
    0 references
    OWA operator
    0 references
    robust optimization
    0 references
    computational complexity
    0 references
    approximation algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references