The Blind Passenger and the Assignment Problem (Q2998855): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Size and Weight of Shortest Path Trees with Exponential Link Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge cover and polymatroid flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An easy proof of the \(\zeta (2)\) limit in the random assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Random Symmetric Travelling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mean field traveling salesman and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Parisi's conjecture on the random assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive bounds and exact expectations for the random assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expected value of the minimum assignment / 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
Property / cites work
 
Property / cites work: The ?(2) limit in the random assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of the random bipartite matching model / rank
 
Normal rank

Latest revision as of 01:39, 4 July 2024

scientific article
Language Label Description Also known as
English
The Blind Passenger and the Assignment Problem
scientific article

    Statements

    The Blind Passenger and the Assignment Problem (English)
    0 references
    11 May 2011
    0 references
    0 references
    discrete random process
    0 references
    minimum cost assignment
    0 references
    0 references