Robustness Concepts for Knapsack and Network Design Problems Under Data Uncertainty (Q2806955): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-28697-6_48 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2462447600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provisioning virtual private networks under traffic uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymatroids and mean-risk minimization in discrete optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The submodular knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank

Latest revision as of 01:05, 12 July 2024

scientific article
Language Label Description Also known as
English
Robustness Concepts for Knapsack and Network Design Problems Under Data Uncertainty
scientific article

    Statements

    Robustness Concepts for Knapsack and Network Design Problems Under Data Uncertainty (English)
    0 references
    0 references
    19 May 2016
    0 references
    knapsack problems
    0 references
    network design problems
    0 references
    data uncertainty
    0 references
    robustness concepts
    0 references

    Identifiers

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