Investigation of path-following algorithms for signomial geometric programming problems

Author： Yang H.-H.   Bricker D.L.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.103, Iss.1, 1997-11, pp. : 230-241

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

GLOBAL OPTIMIZATION FOR SIGNOMIAL DISCRETE PROGRAMMING PROBLEMS IN ENGINEERING DESIGN

By TSAI JUNG-FA   LI HAN-LIN   HU NIAN-ZE  

Engineering Optimization, Vol. 34, Iss. 6, 2002-01 ,pp. : 613-622

Taylor & Francis Ltd

Access to resources Recommend Favorite

The use of dynamic programming in genetic algorithms for permutation problems

By Yagiura M.   Ibaraki T.  

European Journal of Operational Research, Vol. 92, Iss. 2, 1996-07 ,pp. : 387-401

Elsevier

Access to resources Recommend Favorite

Genetic algorithms with double strings for 0-1 programming problems

By Sakawa M.   Kato K.  

European Journal of Operational Research, Vol. 144, Iss. 3, 2003-02 ,pp. : 581-597

Elsevier

Access to resources Recommend Favorite

Fuzzy programming for multiobjective 0-1 programming problems through revised genetic algorithms

By Sakawa M.   Kato K.   Sunada H.   Shibano T.  

European Journal of Operational Research, Vol. 97, Iss. 1, 1997-02 ,pp. : 149-158

Elsevier

Access to resources Recommend Favorite

Shortest path problems with partial information: Models and algorithms for detecting dominance

By Dias L.C.   Clmaco J.N.  

European Journal of Operational Research, Vol. 121, Iss. 1, 2000-02 ,pp. : 16-31

Elsevier

Access to resources Recommend Favorite