Outer approximation algorithms for canonical DC problems

Author： Bigi Giancarlo   Frangioni Antonio   Zhang Qinghua  

Publisher： Springer Publishing Company

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.46, Iss.2, 2010-02, pp. : 163-189

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

Bicriteria approximation algorithms for scheduling problems with communications delays

By Bampis Evripidis   Kononov Alexander  

Journal of Scheduling, Vol. 8, Iss. 4, 2005-07 ,pp. : 281-294

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for k-hurdle Problems

By Dean Brian   Griffis Adam   Parekh Ojas   Whitley Adam  

Algorithmica, Vol. 59, Iss. 1, 2011-01 ,pp. : 81-93

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for Quickest Spanning Tree Problems

By Hassin Refael   Levin Asaf  

Algorithmica, Vol. 41, Iss. 1, 2004-10 ,pp. : 43-52

Springer Publishing Company

Access to resources Recommend Favorite

Improved Approximation Algorithms for Label Cover Problems

By Charikar Moses   Hajiaghayi MohammadTaghi   Karloff Howard  

Algorithmica, Vol. 61, Iss. 1, 2011-09 ,pp. : 190-206

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