Popular recipes tagged "optimal_solution"

Binary search function. (Python)

2011-02-07T06:37:52-08:00

Python recipe 577565 by Kevin L. Sitze (binary, binary_search, bsearch, functional, lower_bound, optimal_solution, search, upper_bound). Revision 3.

For a number of years Python has provided developers with the special parameters 'cmp' and 'key' on list.sort and __builtin__.sorted. However Python does not provide a built-in mechanism for doing binary searches on such sorted lists. This recipe provides a simple function that allows you to perform binary searches on your sorted sequences.

Fast flatten() with depth control and oversight over which subtrees to expand (Python)

2010-11-26T11:10:01-08:00

Python recipe 577470 by Kevin L. Sitze (flatten, iterator, iterators, list, optimal_solution, python, sequence, tuple).

Extremely fast, non-recursive, depth limited flatten with powerful control over which subtrees are to be expanded. If this is what you need then look no further.

Partition Problem and natural selection (Python)

2009-10-27T00:27:14-07:00

Python recipe 576937 by Jai Vikram Singh Verma (approximate_solution, complete, crossover, easiest_hard_problem, generations, genetic_algorithms, natural_selection, np, np_complete, np_hard, optimal_solution, partition_problem). Revision 4.

Partition problem From Wikipedia, the free encyclopedia

In computer science, the partition problem is an NP-complete problem. The problem is to decide whether a given multiset of integers can be partitioned into two "halves" that have the same sum. More precisely, given a multiset S of integers, is there a way to partition S into two subsets S1 and S2 such that the sum of the numbers in S1 equals the sum of the numbers in S2? The subsets S1 and S2 must form a partition in the sense that they are disjoint and they cover S. The optimization version asks for the "best" partition, and can be stated as: Find a partition into two subsets S1,S2 such that max(sum(S_1), sum(S_2)) is minimized (sometimes with the additional constraint that the sizes of the two sets in the partition must be equal, or differ by at most 1).

The partition problem is equivalent to the following special case of the subset sum problem: given a set S of integers, is there a subset S1 of S that sums to exactly t /2 where t is the sum of all elements of S? (The equivalence can be seen by defining S2 to be the difference S − S1.) Therefore, the pseudo-polynomial time dynamic programming solution to subset sum applies to the partition problem as well.

Although the partition problem is NP-complete, there are heuristics that solve the problem in many instances, either optimally or approximately. For this reason, it has been called the "The Easiest Hard Problem" by Brian Hayes.