Heuristics for the central tree problem

ISSN： 1381-1231

Source： Journal of Heuristics, Vol.16, Iss.5, 2010-10, pp. : 633-651

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

Improved heuristics for the bounded-diameter minimum spanning tree problem

By Singh Alok Gupta Ashok

Soft Computing, Vol. 11, Iss. 10, 2007-08 ,pp. : 911-921

Springer Publishing Company

Access to resources Recommend Favorite

New heuristics for the maximum diversity problem

By Silva Geiza Andrade Marcos Ochi Luiz Martins Simone Plastino Alexandre

Journal of Heuristics, Vol. 13, Iss. 4, 2007-08 ,pp. : 315-336

Springer Publishing Company

Access to resources Recommend Favorite

Heuristics for the Maximum Outerplanar Subgraph Problem

By Poranen Timo

Journal of Heuristics, Vol. 11, Iss. 1, 2005-01 ,pp. : 59-88

Springer Publishing Company

Access to resources Recommend Favorite

Comparing several heuristics for a packing problem

By Pintea Camelia-M.

International Journal of Advanced Intelligence Paradigms, Vol. 4, Iss. 3-4, 2012-02 ,pp. : 268-277

Inderscience Publishers

Access to resources Recommend Favorite

A decomposition heuristics for the container ship stowage problem

By Ambrosino Daniela Sciomachen Anna Tanfani Elena

Journal of Heuristics, Vol. 12, Iss. 3, 2006-05 ,pp. : 211-233

Springer Publishing Company

Access to resources Recommend Favorite