Approximation algorithms for the design of SDH/SONET networks

Author： Brauner Nadia   Crama Yves   Finke Gerd   Lemaire Pierre   Wynants Christelle  

Publisher： Edp Sciences

E-ISSN： 1290-3868|37|4|235-247

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.37, Iss.4, 2010-03, pp. : 235-247

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

USING SITING ALGORITHMS IN THE DESIGN OF MARINE RESERVE NETWORKS

By  

Ecological Applications, Vol. 13, Iss. sp1, 2003-02 ,pp. : 185-198

John Wiley & Sons Inc

Access to resources Recommend Favorite

Super-polynomial approximation branching algorithms∗

By Escoffier Bruno   Paschos Vangelis Th.   Tourniaire Emeric  

RAIRO - Operations Research, Vol. 50, Iss. 4-5, 2016-11 ,pp. : 979-994

Edp Sciences

Access to resources Recommend Favorite

Approximation Algorithms for the Traveling Salesman Problem with Range Condition

By D. Arun Kumar C.   Pandu Rangan C.  

RAIRO - Theoretical Informatics and Applications, Vol. 34, Iss. 3, 2010-03 ,pp. : 173-181

Edp Sciences

Access to resources Recommend Favorite

Scheduling in the presence of processor networks : complexity and approximation

By Boudet Vincent   Cohen Johanne   Giroudeau Rodolphe   König Jean-Claude  

RAIRO - Operations Research, Vol. 46, Iss. 1, 2012-05 ,pp. : 1-22

Edp Sciences

Access to resources Recommend Favorite

Genetic algorithms in materials design and processing

By Chakraborti N.  

International Materials Reviews, Vol. 49, Iss. 3-4, 2004-06 ,pp. : 246-260

Maney Publishing

Access to resources Recommend Favorite