Deterministic Sampling Algorithms for Network Design

ISSN： 0178-4617

Source： Algorithmica, Vol.60, Iss.1, 2011-05, pp. : 110-151

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

Related content

Using Nondeterminism to Design Efficient Deterministic Algorithms

By Chen Jianer Firesen Donald K. Jia Weijia Kanj Iyad A.

Algorithmica, Vol. 40, Iss. 2, 2004-07 ,pp. : 83-97

Springer Publishing Company

Access to resources Recommend Favorite

Genetic algorithms and network ring design

By White A.R.P. Mann J.W. Smith G.D.

Annals of Operations Research, Vol. 86, Iss. 1, 1999-01 ,pp. : 347-371

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms for the non-bifurcated network design problem

By Bartolini Enrico Mingozzi Aristide

Journal of Heuristics, Vol. 15, Iss. 3, 2009-06 ,pp. : 259-281

Springer Publishing Company

Access to resources Recommend Favorite

Comparing Metaheuristic Algorithms for Sonet Network Design Problems

By Aringhieri Roberto Dell’Amico Mauro

Journal of Heuristics, Vol. 11, Iss. 1, 2005-01 ,pp. : 35-57

Springer Publishing Company

Access to resources Recommend Favorite

Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network

By Medaglia Andrés Villegas Juan Rodríguez-Coca Diana

Journal of Heuristics, Vol. 15, Iss. 2, 2009-04 ,pp. : 153-176

Springer Publishing Company

Access to resources Recommend Favorite