scientific article; zbMATH DE number 1787233

MaRDI QIDQ4550238zbMATH OpenFDO

Authors Don Coppersmith, Gregory B. Sorkin

Publication date 21 August 2002

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Programming involving graphs or networks (90C35)

Recommendations

• A Lower Bound on the Expected Cost of an Optimal Assignment
• On the expected value of the minimum assignment
• scientific article; zbMATH DE number 4043612
• On the minimum cost range assignment problem
• scientific article; zbMATH DE number 2239572
• A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment
• An efficient cost scaling algorithm for the assignment problem
• An addendum on the incremental assignment problem
• Approximation Algorithms for the Max-Min Allocation Problem

Cited in

(10)

• An addendum on the incremental assignment problem
• Random matching problems on the complete graph
• Minimum cost matching in a random graph with random costs
• Constructive bounds and exact expectations for the random assignment problem
• A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment
• Geometric algorithms for the minimum cost assignment problem
• Edge cover and polymatroid flow problems
• Asymptotic results for random multidimensional assignment problems
• Asymptotic properties of random multidimensional assignment problems
• Incremental assignment problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4550238)