𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simplicial algorithm to solve the nonlinear complementarity problem onSn×R+m

✍ Scribed by M. W. Hofkes

Publisher
Springer
Year
1990
Tongue
English
Weight
750 KB
Volume
67
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm to solve the m × n assignme
An algorithm to solve the m × n assignment problem in expected time O(mn log n)
✍ Richard M. Karp 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 428 KB

## Abstract We give an algorithm to solve the __m__‐source, __n__‐destination assignment problem in expected time __O(mn__ log __n__) under the assumption that the edge costs are independent random variables and the costs of the edges incident with any given source are identically distributed. The