A lower bound on the expected optimal value of certain random linear programs and application to shortest paths in directed acyclic graphs and reliability (Q310679): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear programs with random costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on shortest path, assignment, and transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of the expected optimal value of the multidimensional assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment / rank
 
Normal rank

Latest revision as of 14:03, 12 July 2024

scientific article
Language Label Description Also known as
English
A lower bound on the expected optimal value of certain random linear programs and application to shortest paths in directed acyclic graphs and reliability
scientific article

    Statements

    A lower bound on the expected optimal value of certain random linear programs and application to shortest paths in directed acyclic graphs and reliability (English)
    0 references
    0 references
    0 references
    8 September 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    random networks
    0 references
    random linear programming
    0 references
    reliability
    0 references
    maintenance
    0 references
    Dyer-Frieze-McDiarmid's inequality
    0 references
    shortest path
    0 references
    0 references