Differential approximation algorithms for some combinatorial optimization problems

Author： Demange M. Grisoni P. Th. Paschos V.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.209, Iss.1, 1998-12, pp. : 107-122

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 for some graph theoretical optimization problems

By Moonen Linda

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 4, Iss. 3, 2006-09 ,pp. : 259-261

Springer Publishing Company

Access to resources Recommend Favorite

Approximation of some NP-hard optimization problems by finite machines, in probability

By Hong D. Birget

Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. : 323-339

Elsevier

Access to resources Recommend Favorite

Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems

By Aissi Hassene

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 4, Iss. 4, 2006-12 ,pp. : 347-350

Springer Publishing Company

Access to resources Recommend Favorite

Stability in the Combinatorial Vector Optimization Problems

By Emelichev V. A. Kuz'min K. G. Leonovich A. M.

Automation and Remote Control, Vol. 65, Iss. 2, 2004-02 ,pp. : 227-240

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Combinatorial optimization algorithms for radio network planning

By Calegari P. Guidec F. Kuonen P. Nielsen

Theoretical Computer Science, Vol. 263, Iss. 1, 2001-07 ,pp. : 235-245

Elsevier

Access to resources Recommend Favorite