A New Integer Programming Model about Counterfeit Coin Problem Based on Information Processing Method and Its General Solution

1. Born, A., Hurkens, C.A.J., Woeginger, G.J.: How to detect a counterfeit coin: Adaptive versus non-adaptive solutions. Information Processing Letters 86(3), 137–141 (2003)

   Article  MathSciNet  MATH  Google Scholar 

2. Liu, W.-A., Zhang, Q.-M., Nie, Z.-K.: Searching for a counterfeit coin with two unreliable weightings. Discrete Applied Mathematics 150(1-3), 160–181 (2005)

   Article  MathSciNet  MATH  Google Scholar 

3. Xiao, X.-p.: A Non-Adaptive Algorithm for the General Counterfeit Coin Problem. Journal of University of Electronic Science and Technology of China (S1), 451–453 (2007)

   Google Scholar 

4. Qi, M.N., Li, W.: Unified search procedure with two devices for equilibrium models of two-counterfeit coin problem. System Engineering Theory and Practice 21(9), 73 (2001)

   Google Scholar 

5. Alon, N., Kozlov, D.N.: Coins with Arbitrary Weights. Journal of Algorithms 25(1), 162–176 (1997)

   Article  MathSciNet  MATH  Google Scholar 

6. Xiao, X.-P.: Non-adaptive Solutions to the General Counterfeit Coin Problem. Journal of Nanjing University (Natural Sciences) (5), 506–511 (2006)

   Google Scholar 

7. Li, W., Pan, P.: Unified search procedure with two devices on equilibrium models of two-counterfeit-coin problem. Journal of Southeast University (Natural Science Edition) 3, 536–540 (2002)

   MathSciNet  MATH  Google Scholar 

8. Wang, X.-d.: Dynamic programming algorithm for counterfeit coin problem. Mini-micro Systems (12), 1301–1308 (2000)

   Google Scholar 

Download references