A Linear–Programming Method for the Combinatorial Grouping of an Incomplete Power Set
From MaRDI portal
Publication:4133411
DOI10.1080/01969727508545920zbMath0357.90046OpenAlexW2002644844MaRDI QIDQ4133411
Publication date: 1976
Published in: Journal of Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01969727508545920
Integer programming (90C10) Combinatorial aspects of partitions of integers (05A17) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items (5)
A tabu search algorithm for the cell formation problem with part machine sequencing ⋮ Multiple objective decision making approach to cell formation: A goal programming model ⋮ A novel approach to determine cell formation, intracellular machine layout and cell layout in the CMS problem based on TOPSIS method ⋮ Fuzzy extensions to integer programming models of cell-formation problems in machine scheduling ⋮ A polynomial-time algorithm for optimal clustering in a special class of {0, l} -matrices
This page was built for publication: A Linear–Programming Method for the Combinatorial Grouping of an Incomplete Power Set
