The Analysis of Evolutionary Algorithms on Sorting and Shortest Paths Problems: Evolutionary Computation Combinatorial Optimization (Editors: Jens Gottlieb, Emma Hart, Martin Middendorf, Günter Raidl and Colin Reeves)

Author： Scharnow Jens   Tinnefeld Karsten   Wegener Ingo  

Publisher： Springer Publishing Company

ISSN： 1570-1166

Source： Journal of Mathematical Modelling and Algorithms, Vol.3, Iss.4, 2004-01, pp. : 349-366

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

The Linear Ordering Problem: Instances, Search Space Analysis and Algorithms: Evolutionary Computation Combinatorial Optimization (Editors: Jens Gottlieb, Emma Hart, Martin Middendorf, Günter Raidl and Colin Reeves)

By Schiavinotto Tommaso   Stützle Thomas  

Journal of Mathematical Modelling and Algorithms, Vol. 3, Iss. 4, 2004-01 ,pp. : 367-402

Springer Publishing Company

Access to resources Recommend Favorite

Contents of Volume 3 (2004): Evolutionary Computation Combinatorial Optimization (Editors: Jens Gottlieb, Emma Hart, Martin Middendorf, Günter Raidl and Colin Reeves)

By  

Journal of Mathematical Modelling and Algorithms, Vol. 3, Iss. 4, 2004-01 ,pp. : 427-429

Springer Publishing Company

Access to resources Recommend Favorite

Solving the Probabilistic TSP with Ant Colony Optimization: Evolutionary Computation Combinatorial Optimization (Editors: Jens Gottlieb, Emma Hart, Martin Middendorf, Günter Raidl and Colin Reeves)

By Branke Jürgen   Guntsch Michael  

Journal of Mathematical Modelling and Algorithms, Vol. 3, Iss. 4, 2004-01 ,pp. : 403-425

Springer Publishing Company

Access to resources Recommend Favorite

A No-Free-Lunch Theorem for Non-Uniform Distributions of Target Functions: Evolutionary Computation Combinatorial Optimization (Editors: Jens Gottlieb, Emma Hart, Martin Middendorf, Günter Raidl and Colin Reeves)

By Igel Christian   Toussaint Marc  

Journal of Mathematical Modelling and Algorithms, Vol. 3, Iss. 4, 2004-01 ,pp. : 313-322

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms for shortest paths and d-cycle problems

By Bespamyatnikh S.   Kelarev A.  

Journal of Discrete Algorithms, Vol. 1, Iss. 1, 2003-02 ,pp. : 1-9

Elsevier

Access to resources Recommend Favorite