飞镖铝齐默尔曼的儿子 [英] Al Zimmermann's Son of Darts

问题描述

有2个月左右留在铝齐默尔曼的儿子飞镖程序设计大赛，而且我想提高我站在（目前在60年代）的东西更值得尊敬。我希望得到一些想法从计算器的伟大的社会就如何最好地解决这个问题。

There's about 2 months left in Al Zimmermann's Son of Darts programming contest, and I'd like to improve my standing (currently in the 60s) to something more respectable. I'd like to get some ideas from the great community of stackoverflow on how best to approach this problem.

本次大赛的问题是被称为全球邮票问题的文献中。我没有与优化算法太多的经验（我知道爬山和模拟退火只在大学的理念），事实上，我现在所拥有的程序基本上是纯粹的暴力，这当然是行不通的更大的搜索空间。

The contest problem is known as the Global Postage Stamp Problem in literatures. I don't have much experience with optimization algorithms (I know of hillclimbing and simulated annealing in concept only from college), and in fact the program that I have right now is basically sheer brute force, which of course isn't feasible for the larger search spaces.

下面是一些关于这个问题的论文：

Here are some papers on the subject:

• 一张邮票的问题（阿尔特和放大器;巴尼特，1980）
• 算法计算邮票问题的H-范围（Mossige，1981）
• 一张邮票的问题（Lunnon，1986）
• 两个用于计算极值H-基地阿克（查利斯，1992年新技术）

• A Postage Stamp Problem (Alter & Barnett, 1980)
• Algorithms for Computing the h-Range of the Postage Stamp Problem (Mossige, 1981)
• A Postage Stamp Problem (Lunnon, 1986)
• Two New Techniques for Computing Extremal h-bases Ak (Challis, 1992)

任何提示和建议，欢迎。此外，请随时告诉我去正确的网站，如果计算器是吧。

Any hints and suggestions are welcome. Also, feel free to direct me to the proper site if stackoverflow isn't it.

推荐答案

我不熟悉的问题。但是，也许你可以做这样的事情分行及放大器;势必要摆脱暴力方面的。

I am not familiar with the problem. But maybe you could do things like branch & bound to get rid of the brute force aspect.

http://en.wikipedia.org/wiki/Branch_and_bound

这篇关于飞镖铝齐默尔曼的儿子的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！