Enumerating nested and consecutive partitions
From MaRDI portal
Publication:1805062
DOI10.1016/0097-3165(95)90097-7zbMATH Open0819.05005OpenAlexW2098780983MaRDI QIDQ1805062FDOQ1805062
Authors: Frank K. Hwang, Colin L. Mallows 
Publication date: 11 May 1995
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(95)90097-7
Recommendations
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)
Cites Work
- On clustering problems with connected optima in Euclidean spaces
- Optimal partitions
- Optimal Set Partitioning
- Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment
- Structured Partitioning Problems
- Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment
- Valency enumeration of rooted plane trees
Cited In (11)
- Chord diagrams, contact-topological quantum field theory and contact categories
- Sphere-separable partitions of multi-parameter elements
- Succession rules and Deco polyominoes
- Localizing combinatorial properties of partitions
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the number of separable partitions
- Fibonacci colored compositions and applications
- Title not available (Why is that?)
- The monoid of ordered partitions of a natural number
- Bijections between directed-column convex polyominoes and restricted compositions
This page was built for publication: Enumerating nested and consecutive partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1805062)
