Efficient algorithms for three‐dimensional axial and planar random assignment problems (Q5175234): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Asymptotics in the random assignment problem / 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: On the expected value of the minimum assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems / 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 linear programs with random costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm and Average-value Bounds for Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of a 3-dimensional assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the value of a random minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors in random graphs / 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: Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem / 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: Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Component structure in the evolution of random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function / 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

Latest revision as of 18:00, 9 July 2024

scientific article; zbMATH DE number 6406612
Language Label Description Also known as
English
Efficient algorithms for three‐dimensional axial and planar random assignment problems
scientific article; zbMATH DE number 6406612

    Statements

    Efficient algorithms for three‐dimensional axial and planar random assignment problems (English)
    0 references
    0 references
    0 references
    0 references
    20 February 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    random assignment problems
    0 references
    algorithms
    0 references
    probabilistic analysis
    0 references
    average-case analysis
    0 references
    0 references
    0 references
    0 references