Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.49, Iss.2, 2011-02, pp. : 237-263

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

Algorithms to solve some problems of concave programming with linear constraints

By Sergeev S.

Automation and Remote Control, Vol. 68, Iss. 3, 2007-03 ,pp. : 399-412

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Using genetic algorithm methods to solve course scheduling problems

By Wang Y.-Z.

Expert Systems with Applications, Vol. 25, Iss. 1, 2003-07 ,pp. : 39-50

Elsevier

Access to resources Recommend Favorite

An Algorithm for the Solution of Multiparametric Mixed Integer Linear Programming Problems

By Dua V. Pistikopoulos E.N.

Annals of Operations Research, Vol. 99, Iss. 1-4, 2000-12 ,pp. : 123-139

Springer Publishing Company

Access to resources Recommend Favorite

An algorithm for non-linear multi-level integer programming problems

By Arora Ritu

International Journal of Computing Science and Mathematics, Vol. 3, Iss. 3, 2010-12 ,pp. : 211-225

Inderscience Publishers

Access to resources Recommend Favorite

Using distance transform to solve real-time machine vision inspection problems

By Lee Dah-Jye Archibald James Xu Xiaoqian Zhan Pengcheng

Machine Vision and Applications, Vol. 18, Iss. 2, 2007-04 ,pp. : 85-93

Springer Publishing Company

Access to resources Recommend Favorite