An upper bound for the permanent of (0,1)-matrices

A novel upper bound for the permanent of (0,1)-matrices is obtained in this paper, by using an unbiased estimator of permanent [Random Structures Algorithms 5 (1994) 349]. It is a refinement of Minc’s very famous result, and apparently tighter than the current best general bound in some cases.