Management Science, Vol. 28, No. 7 (Jul., 1982), pp. 829-836 (8 pages) We develop in this paper two types of heuristic methods for solving the positive 0-1 polynomial programming (PP) problem of ...

The weighted maximal planar graph (WMPG) is practically important in the laying out of facilities in modern manufacturing environments. Given a weighted complete graph, the WMPG seeks to find a ...

Pole Przemyslaw "Psyho" Debiak won the prestigious AWTF Heuristic programming tournament. He beat not only the human participants, but also AI. He is the only human to have succeeded. A Polish ...

Forbes contributors publish independent expert analyses and insights. Gil Press writes about technology, entrepreneurs and innovation. This article is more than 5 years old. MYCIN was an AI program ...