An objective space cut and bound algorithm for convex multiplicative programmes

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.58, Iss.4, 2014-04, pp. : 711-728

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

Related content

An approximation algorithm for convex multi-objective programming problems

By Ehrgott Matthias

Journal of Global Optimization, Vol. 50, Iss. 3, 2011-07 ,pp. : 397-416

Springer Publishing Company

Access to resources Recommend Favorite

Analytics on Fireworks Algorithm Solving Problems with Shifts in the Decision Space and Objective Space

International Journal of Swarm Intelligence Research (IJSIR), Vol. 6, Iss. 2, 2015-04 ,pp. : 52-86

IGI Global_journal

Access to resources Recommend Favorite

Beyond Convex? Global Optimization is Feasible Only for Convex Objective Functions: A Theorem

By Kreinovich Vladik Kearfott R.

Journal of Global Optimization, Vol. 33, Iss. 4, 2005-12 ,pp. : 617-624

Springer Publishing Company

Access to resources Recommend Favorite

An algorithm reconstructing convex lattice sets

By Brunetti S. Daurat A.

Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. : 35-57

Elsevier

Access to resources Recommend Favorite

A finite steps algorithm for solving convex feasibility problems

By Rami M. Helmke U. Moore J.

Journal of Global Optimization, Vol. 38, Iss. 1, 2007-05 ,pp. : 143-160

Springer Publishing Company

Access to resources Recommend Favorite