Finding part-machine families using graph partitioning techniques (Q4230183): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207549608904999 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977524039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Partitioning the Nodes of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Heuristic for Partitioning the Nodes of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ideal seed non-hierarchical clustering algorithm for cellular manufacturing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation techniques for hypergraph partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gomory-Hu cut tree representation of a netlist partitioning problem / rank
 
Normal rank

Latest revision as of 18:47, 28 May 2024

scientific article; zbMATH DE number 1256512
Language Label Description Also known as
English
Finding part-machine families using graph partitioning techniques
scientific article; zbMATH DE number 1256512

    Statements