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 OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Recent directions in netlist partitioning: a survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A hypergraph framework for optimal model-based decomposition of design problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Infrastructural analysis and restriction in the evolution of weather systems / rank | |||
Normal rank | |||
Latest revision as of 08:56, 4 July 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
0 references
