This work proposes a new method for computing acceptance regions of exact multinomial tests. From this an algorithm is derived, which finds p-values tests simple hypotheses. Using concepts from discrete convex analysis, the proven to be various popular test statistics, including Pearson’s Chi-square and log-likelihood ratio. The proposed improves greatly on naive approach using full enumeration...

An Enhancement to the exact algorithm of Daskin (1995) to solve the vertex P center problem is proposed. A simple enhancement which uses tighter initial lower and upper bounds, and a more appropriate binary search method are introduced to reduce the number of subproblems to be solved. These ideas are tested on a well known set of problems from the literature (i.e., TSP-Lib problems) with encour...