A global method for the limited K-partitioning of hypergraphs representing optimal design problems in complex machine systems

Author： Shuiping Li Xiaoxue Wan

Publisher： Emerald Group Publishing Ltd

ISSN： 0368-492X

Source： Kybernetes: The International Journal of Systems & Cybernetics, Vol.39, Iss.6, 2010-01, pp. : 980-989

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems

By Okumoto Kazumasa Fukunaga Takuro Nagamochi Hiroshi

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 787-806

Springer Publishing Company

Access to resources Recommend Favorite

The method of analytical design of quasi-optimal control systems with polynomial nonlinearities

By Lovchakov V.

Automation and Remote Control, Vol. 68, Iss. 6, 2007-06 ,pp. : 979-992

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

An interactive method for the selection of design criteria and the formulation of optimization problems in computer aided optimal design

By Maute K. Raulli M.

Computers and Structures, Vol. 82, Iss. 1, 2004-01 ,pp. : 71-79

Elsevier

Access to resources Recommend Favorite

Modelling systems by hypergraphs

By GazdÃk Igor

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 35, Iss. 9, 2006-10 ,pp. : 1369-1381

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Optimal design of induction machine using interval algorithms

By Samarkanov Dmitry Gillon Frédéric Brochet Pascal Laloy Daniel

COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol. 31, Iss. 5, 2012-09 ,pp. : 1492-1502

Emerald Group Publishing Ltd

Access to resources Recommend Favorite