A Linear–Programming Method for the Combinatorial Grouping of an Incomplete Power Set

DOI10.1080/01969727508545920MaRDI QIDQ4133411zbMATH OpenOpenAlexFDO

Authors Gunter F. K. Purcheck

Publication date 1976

Published in Journal of Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01969727508545920

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Integer programming (90C10)

Cited in

(5)

• Fuzzy extensions to integer programming models of cell-formation problems in machine scheduling
• A tabu search algorithm for the cell formation problem with part machine sequencing
• A polynomial-time algorithm for optimal clustering in a special class of {0, l} -matrices
• 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

This page was built for publication: A Linear–Programming Method for the Combinatorial Grouping of an Incomplete Power Set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133411)