Algorithm for constrained set partition (combinatorics with C++)

I need a reasonably efficient algorithm implemented for a specific integer partition problem.

In short, I have a multiset of integers, each of which belongs to a subset. I don't know the matching of integers to subsets; only the number and sum of elements in each subset. In general this means there are multiple partitions that fit the constraint. If we assume these partitions are equally likely, I want to find the likelihood that each integer value may belong to each of the subsets.

I have written a more formal description of the problem here:

[login to view URL]

I've been struggling to find a good algorithm for this presumably NP-hard problem. It's clearly related to the set partition problem, but I'm having trouble finding the right approach given the many, many variants out there.


C++ code which takes two arbitrary tables of integers as input (see PDF for an example), and outputs a table with four columns:

each integer value x_k from the multiset, repeated for each of the subsets in column 2

the subset id j=1,...,J, repeated as needed to produce each combination with column 1

the number of possible partitions where integer x_k is in subset j (numerator of the probability)

the number of possible partitions (denominator of the probability) – same value for all rows

I need an algorithm that does not need all partitions in memory as it enumerates through them, or it may fail on more complex cases.

Some lexicographic approach would be ideal in case e.g. I want to parallelize the code later or sample partitions rather than fully enumerate (this is NOT part of this request!).

The use of GMP might be a good idea to handle larger integers.

We can decide on the data format that's most convenient for input and output. I think CSV may be okay at this stage. I'll provide some examples for testing the algorithm.

This code will be used for academic research, and may be published at some point in the future, so I'd like to put the code under a MIT license (negotiable).

Soft deadline, but the sooner the better of course :)

Happy to clarify anything that's not entirely clear!

Skills: C++ Programming, C Programming, Algorithm, Mathematics, Software Architecture

See more: magento constraint fk_sales_order_customer foreign key customer_id references customer_entity entity_id delete set null update c, algorithm and data structure in c, algorithm for binary search in c, algorithm for prime numbers in c, algorithm for priority queue in c, algorithm of binary search in c, algorithm of prime number in c, disjoint set data structure c code, linked list algorithm in data structure using c, set bit in c, set bits in c, how to write algorithm for for loop in c, dijkstra algorithm using priority queue in c++, how to set timer in c#, disjoint set data structure c++, you don t know js 6 volumes set, algorithm for simple calculator in c, algorithm for snake game in c, don't know how to build task 'db:environment:set'

About the Employer:
( 0 reviews ) Zurich, Switzerland

Project ID: #30493029

4 freelancers are bidding on average $113 for this job


SOFTWARE ARCHITECTURE EXPERT!!! EXPERT IN C++ HELLO DEAR CLIENT I have gone through your project details and the work is DOABLE since its within my area of EXPERTISE.I will tackle are required guideline to deliver desi More

$140 USD in 7 days
(33 Reviews)

Hi, I've read your description carefully. I have more than 11 years experience with C/C++/Algorithm. ************************************************************************************* I'm confident in your project w More

$120 USD in 5 days
(2 Reviews)

I will read all notes and verify the notes. I will do my best. Please grant me this project to me.

$140 USD in 7 days
(0 Reviews)

Hello, I have MSc in computational engineering and PhD. I have written C++ codes. I can deliver your requirements. Please fell free to contact me to discuss your problem.

$50 USD in 7 days
(0 Reviews)