A global method for the limited K‐partitioning of hypergraphs representing optimal design problems in complex machine systems (Q3018714): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1108/03684921011046753 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2069382591 / rank | |||
Normal rank | |||
Revision as of 01:58, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A global method for the limited K‐partitioning of hypergraphs representing optimal design problems in complex machine systems |
scientific article |
Statements
A global method for the limited K‐partitioning of hypergraphs representing optimal design problems in complex machine systems (English)
0 references
27 July 2011
0 references
cybernetics
0 references
design calculations
0 references
electric machines
0 references
systems and control theory
0 references
