Combinatorial solution of the partition problem for a discrete set
From MaRDI portal
Publication:1264591
DOI10.1007/BF02665893zbMATH Open0907.90225OpenAlexW2016376151MaRDI QIDQ1264591FDOQ1264591
Authors: A. I. Stiranka
Publication date: 22 November 1998
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02665893
Recommendations
- Combinatorics of set partitions
- scientific article; zbMATH DE number 4045507
- scientific article; zbMATH DE number 1615288
- scientific article; zbMATH DE number 3976788
- scientific article; zbMATH DE number 1816804
- On the sumset partition problem
- A Generalization of the Partition Problem
- Discrete version of an optimal partitioning problem
- Complementary set partitions
- scientific article; zbMATH DE number 7310228
Cites Work
Cited In (11)
- Partitioning a finite set by a dynamic programming method
- Exact cover problem in Milton Babbitt's all-partition array
- Partition of a set of objects in the problem of the distribution of \(n\) objects between \(n\) participants
- Title not available (Why is that?)
- An allocation problem with constraints
- Title not available (Why is that?)
- Division of a set of segments into nonintersecting parts on a discrete plane
- Complete sets of solutions to partition-distribution equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- On probabilistic algorithm for solving almost all instances of the set partition problem
This page was built for publication: Combinatorial solution of the partition problem for a discrete set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1264591)