Reducing computational effort in field optimisation problems

ISSN： 0332-1649

Source： COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol.23, Iss.1, 2004-03, pp. : 159-172

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

Reducing the complexity order of the algorithms for magnetic field nonlinear problems

By Munteanu Irina Ciobotaru Caˇtaˇlin Ioan Daniel

COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol. 21, Iss. 2, 2002-02 ,pp. : 286-295

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Multilevel Refinement for Combinatorial Optimisation Problems

By Walshaw Chris

Annals of Operations Research, Vol. 131, Iss. 1-4, 2004-10 ,pp. : 325-372

Springer Publishing Company

Access to resources Recommend Favorite

Optimisation problems for control of distributed resources

By Konnov Igor V. Kashina Olga A. Laitinen Erkki

International Journal of Modelling, Identification and Control, Vol. 14, Iss. 1-2, 2011-09 ,pp. : 65-72

Inderscience Publishers

Access to resources Recommend Favorite

Field methods and computational techniques

By Savini A

COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol. 19, Iss. 2, 2000-02 ,pp. : 165-200

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

On the computational complexity of dynamic graph problems

By Ramalingam G. Reps T.

Theoretical Computer Science, Vol. 158, Iss. 1, 1996-05 ,pp. : 233-277

Elsevier

Access to resources Recommend Favorite