A Finite Algorithm for Solving Infinite Dimensional Optimization Problems

Author： Schochetman I.E.  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.101, Iss.1-4, 2001-01, pp. : 119-142

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

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

Searching for Backbones-a high-performance parallel algorithm for solving combinatorial optimization problems

By Schneider J.  

Future Generation Computer Systems, Vol. 19, Iss. 1, 2003-01 ,pp. : 121-131

Elsevier

Access to resources Recommend Favorite

A Dual-based Combinatorial Algorithm for Solving Cyclic Optimization Problems

By  

Recent Patents on Computer Science, Vol. 5, Iss. 3, 2012-12 ,pp. : 188-196

Bentham Science Publishers

Access to resources Recommend Favorite

An Algorithm for Solving Optimization Problems with One Linear Objective Function and Finitely Many Constraints of Fuzzy Relation Inequalities

By Guo Fang-Fang   Xia Zun-Quan  

Fuzzy Optimization and Decision Making, Vol. 5, Iss. 1, 2006-01 ,pp. : 33-47

Springer Publishing Company

Access to resources Recommend Favorite

Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems

By Tang Jing   Lim Meng   Ong Yew  

Soft Computing, Vol. 11, Iss. 9, 2007-07 ,pp. : 873-888

Springer Publishing Company

Access to resources Recommend Favorite