41 Counterexamples to property (B) of the discrete time bomber problem
该文通过计算近百万组参数值的精确解，找到了离散时间轰炸机问题中一个自1968年未决的单调性猜想（性质B）的41个反例，并附有可验证的Mathematica程序。
The discrete time “bomber problem” has been one of the longest standing open problems in operations research. In particular, the validity of one of the natural monotonicity conjectures—known as property (B)—has been an unresolved issue since 1968. In this paper we report 41 counterexamples to property (B) of this problem. We have found them by computing the exact solutions for nearly one million pairs of parameter values utilizing the GNU multiple precision arithmetic library. All our counterexamples can readily be verified using a simple Mathematica program included in this paper.