Computational aspects of ordered integer partitions with bounds
From MaRDI portal
Publication:2006947
Recommendations
- An efficient representation of partitions of integers
- Fast algorithms for genegrating integer partitions
- Compositions of integers with bounded parts
- A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions
- Partitions of an Integer into Powers
Cites work
- A generalization of multiple choice balls-into-bins: tight bounds
- Balls in constrained urns and Cantor-like sets
- Faster algorithms for Frobenius numbers
- Foundations of mathematical economics
- scientific article; zbMATH DE number 1222942 (Why is no real title available?)
- scientific article; zbMATH DE number 1301967 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 3285978 (Why is no real title available?)
- scientific article; zbMATH DE number 3059214 (Why is no real title available?)
- scientific article; zbMATH DE number 3092634 (Why is no real title available?)
- Invitation to discrete mathematics
- Johann Faulhaber and Sums of Powers
- Multi-objective combinatorial optimization: problematic and context
This page was built for publication: Computational aspects of ordered integer partitions with bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2006947)