A global method for the limited K‐partitioning of hypergraphs representing optimal design problems in complex machine systems
From MaRDI portal
Publication:3018714
DOI10.1108/03684921011046753zbMath1221.93023OpenAlexW2069382591MaRDI QIDQ3018714
Publication date: 27 July 2011
Published in: Kybernetes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1108/03684921011046753
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- A hypergraph framework for optimal model-based decomposition of design problems
- Recent directions in netlist partitioning: a survey
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- An Efficient Heuristic Procedure for Partitioning Graphs
- Infrastructural analysis and restriction in the evolution of weather systems
This page was built for publication: A global method for the limited K‐partitioning of hypergraphs representing optimal design problems in complex machine systems
