A cell formation algorithm: Hypergraph approximation -- cut tree
From MaRDI portal
Publication:1303737
DOI10.1016/S0377-2217(97)00143-4zbMath0943.90021MaRDI QIDQ1303737
Publication date: 16 September 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On an optimization problem occurring in FMSs: A hypergraph-theoretical formulation
- An ideal seed non-hierarchical clustering algorithm for cellular manufacturing
- ZODIAC—an algorithm for concurrent formation of part-families and machine-cells
- Multi-Terminal Network Flows
- A comparative study of cell formation in cellular manufacturing systems
- Equivalence of Memory to “Random Logic”
- A Review of the Placement and Quadratic Assignment Problems