Contribution for crossover and mutation for degree constrained minimum spanning tree problem (d-MSTP)

ISSN： 1756-5154

Source： International Journal of Engineering Management and Economics, Vol.3, Iss.1-2, 2012-08, pp. : 74-94

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

A spanning tree approach to the absolute p-center problem

By Bozkaya B. Tansel B.

Location Science, Vol. 6, Iss. 1, 1998-05 ,pp. : 83-107

Elsevier

Access to resources Recommend Favorite

An algorithm for the disjunctively constrained knapsack problem

By Hi? Mhand Otmani Nabil

International Journal of Operational Research, Vol. 13, Iss. 1, 2012-12 ,pp. : 22-43

Inderscience Publishers

Access to resources Recommend Favorite

A GRASP strategy for a more constrained School Timetabling Problem

By Moura Arnaldo Vieira Scaraficci Rafael Augusto

International Journal of Operational Research, Vol. 7, Iss. 2, 2010-01 ,pp. : 152-170

Inderscience Publishers

Access to resources Recommend Favorite

The single facility location problem with minimum distance constraints

By Konforty Y. Tamir A.

Location Science, Vol. 5, Iss. 3, 1997-10 ,pp. : 147-163

Elsevier

Access to resources Recommend Favorite

Multi-parent extension of sequential constructive crossover for the travelling salesman problem

By Ahmed Zakir Hussain

International Journal of Operational Research, Vol. 11, Iss. 3, 2011-07 ,pp. : 331-342

Inderscience Publishers

Access to resources Recommend Favorite