Strategic design of competing supply chain networks with foresight (Q532462): 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: 90B06 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C90 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A80 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5883987 / rank
 
Normal rank
Property / zbMATH Keywords
 
supply chain network design
Property / zbMATH Keywords: supply chain network design / rank
 
Normal rank
Property / zbMATH Keywords
 
Stackelberg game
Property / zbMATH Keywords: Stackelberg game / rank
 
Normal rank
Property / zbMATH Keywords
 
linear bi-level program
Property / zbMATH Keywords: linear bi-level program / rank
 
Normal rank
Property / zbMATH Keywords
 
meta-heuristic
Property / zbMATH Keywords: meta-heuristic / rank
 
Normal rank
Property / zbMATH Keywords
 
minimum regret strategy
Property / zbMATH Keywords: minimum regret strategy / rank
 
Normal rank
Property / zbMATH Keywords
 
game against nature
Property / zbMATH Keywords: game against nature / rank
 
Normal rank

Revision as of 08:10, 1 July 2023

scientific article
Language Label Description Also known as
English
Strategic design of competing supply chain networks with foresight
scientific article

    Statements

    Strategic design of competing supply chain networks with foresight (English)
    0 references
    4 May 2011
    0 references
    supply chain network design
    0 references
    Stackelberg game
    0 references
    linear bi-level program
    0 references
    meta-heuristic
    0 references
    minimum regret strategy
    0 references
    game against nature
    0 references

    Identifiers