登入選單

返回Google圖書搜尋

Random Walks, Totally Unimodular Matrices and a Randomised Dual Simplex Algorithm

Martin Dyer

出版	Carnegie Mellon University, Department of Mathematics, 1991
URL	http://books.google.com.hk/books?id=jul-NwAACAAJ&hl=&source=gbs_api

註釋

Abstract: "We discuss the application of random walks to generating a random basis of a totally unimodular matrix and to solving a linear program with such a constraint matrix. We also derive polynomial upper bounds on the combinatorial diameter of an associated polyhedron."