I never participated in IOI, but at least in ACM contests I have never seen a pr... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		pdany on May 20, 2010 \| parent \| context \| favorite \| on: The Prolog Story I never participated in IOI, but at least in ACM contests I have never seen a problem where suboptimal heuristic search was allowed.

barrkel on May 20, 2010 [–]

Now we're mixing up two criteria. Contest problems are small enough that an optimal solution can be found in reasonable time; but since packing problems usually end up NP complete or NP hard, in the real world you'll end up using heuristics.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact