Approximability of hard combinatorial optimization problems: an introduction

Author： Maffioli Francesco   Galbiati Giulia  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.96, Iss.1-4, 2000-11, pp. : 221-236

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

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

Exact and heuristic solutions for combinatorial optimization problems

By Díaz Díaz José  

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 12, Iss. 1, 2014-03 ,pp. : 95-96

Springer Publishing Company

Access to resources Recommend Favorite

Differential approximation algorithms for some combinatorial optimization problems

By Demange M.   Grisoni P.   Th. Paschos V.  

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

Elsevier

Access to resources Recommend Favorite

BIANCA: a genetic algorithm to solve hard combinatorial optimisation problems in engineering

By Vincenti Angela   Ahmadian Mohammad   Vannucci Paolo  

Journal of Global Optimization, Vol. 48, Iss. 3, 2010-11 ,pp. : 399-421

Springer Publishing Company

Access to resources Recommend Favorite

On the approximability of clique and related maximization problems

By Srinivasan A.  

Journal of Computer and System Sciences, Vol. 67, Iss. 3, 2003-11 ,pp. : 633-651

Elsevier

Access to resources Recommend Favorite