partition_greedy


partition_greedy, a Python code which uses a greedy algorithm to seek a solution of the partition problem, in which a given set of integers is to be split into two groups whose sums are as close as possible.

Licensing:

The computer code and data files described and made available on this web page are distributed under the MIT license

Languages:

partition_greedy is available in a MATLAB version and a Python version.

Related Data and Programs:

change_making, A Python code which considers the change making problem, in which a given sum is to be formed using coins of various denominations.

combo, A Python code which includes many combinatorial routines.

partition_brute, A Python code which uses a brute force method to find solutions of the partition problem, in which a set of integers must be split into two subsets with equal sum.

satisfy, A Python code which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfiability problem.

subset, A Python code which enumerates, generates, ranks and unranks combinatorial objects including combinations, partitions, subsets, index sets, and trees.

subset_sum, A Python code which seeks solutions of the subset sum problem.

tsp_greedy, a Python code which reads a file of city-to-city distances, and solves a small traveling salesperson problem (TSP) using the greedy algorithm. It picks a starting city at random, and then successively visits the nearest unvisited city.

Reference:

  1. Alexander Dewdney,
    The Turing Omnibus,
    Freeman, 1989,
    ISBN13: 9780716781547,
    LC: QA76.D45.
  2. Brian Hayes,
    The Easiest Hard Problem,
    American Scientist,
    Volume 90, Number 2, March-April 2002, pages 113-117.
  3. Silvano Martello, Paolo Toth,
    Knapsack Problems: Algorithms and Computer Implementations,
    Wiley, 1990,
    ISBN: 0-471-92420-2,
    LC: QA267.7.M37.

Source Code:


Last revised on 17 October 2022.