A greedy random adaptive search procedure for the weighted maximal planar graph problem

Author： Osman I.H. Al-Ayoubi B. Barake M.

Publisher： Elsevier

ISSN： 0360-8352

Source： Computers and Industrial Engineering, Vol.45, Iss.4, 2003-12, pp. : 635-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

Related content

Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

By Grosso A. Locatelli M. Croce F. Della

Journal of Heuristics, Vol. 10, Iss. 2, 2004-03 ,pp. : 135-152

Springer Publishing Company

Access to resources Recommend Favorite

A random search and backtracking procedure for transfer line balancing

By Finel B.

International Journal of Computer Integrated Manufacturing, Vol. 21, Iss. 4, 2008-06 ,pp. : 376-387

Taylor & Francis Ltd

Access to resources Recommend Favorite

The maximal f-dependent set problem for planar graphs is in NC

By Zhi-Zhong C.

Theoretical Computer Science, Vol. 143, Iss. 2, 1995-06 ,pp. : 309-318

Elsevier

Access to resources Recommend Favorite

An Exact Procedure for the Resource-Constrained Weighted Earliness–Tardiness Project Scheduling Problem

By Vanhoucke M.

Annals of Operations Research, Vol. 102, Iss. 1-4, 2001-02 ,pp. : 179-196

Springer Publishing Company

Access to resources Recommend Favorite

An Application of Tabu Search Heuristic for the Maximum Edge-Weighted Subgraph Problem

By Macambira E.M.

Annals of Operations Research, Vol. 117, Iss. 1-4, 2002-11 ,pp. : 175-190

Springer Publishing Company

Access to resources Recommend Favorite