An \(s\)-\(t\) connection problem with adaptability (Q534328): 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: 90C35 / 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: 5895530 / rank
 
Normal rank
Property / zbMATH Keywords
 
robust optimization
Property / zbMATH Keywords: robust optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
\(s\)-\(t\) connectivity
Property / zbMATH Keywords: \(s\)-\(t\) connectivity / rank
 
Normal rank
Property / zbMATH Keywords
 
shortest path
Property / zbMATH Keywords: shortest path / rank
 
Normal rank
Property / zbMATH Keywords
 
two-stage optimization
Property / zbMATH Keywords: two-stage optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
adaptability
Property / zbMATH Keywords: adaptability / rank
 
Normal rank

Revision as of 08:39, 1 July 2023

scientific article
Language Label Description Also known as
English
An \(s\)-\(t\) connection problem with adaptability
scientific article

    Statements

    An \(s\)-\(t\) connection problem with adaptability (English)
    0 references
    0 references
    0 references
    17 May 2011
    0 references
    robust optimization
    0 references
    \(s\)-\(t\) connectivity
    0 references
    shortest path
    0 references
    two-stage optimization
    0 references
    adaptability
    0 references

    Identifiers