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

ISSN： 0254-5330

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

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 tabu search heuristic for the component assignment problem in PCB assembly

By Wan Y.F. Ji P

Assembly Automation, Vol. 21, Iss. 3, 2001-07 ,pp. : 236-240

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

An iterated-tabu-search heuristic for a variant of the partial set covering problem

By Bilal Nehme Galinier Philippe Guibault Francois

Journal of Heuristics, Vol. 20, Iss. 2, 2014-04 ,pp. : 143-164

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

An Application of a Multi-Objective Tabu Search Algorithm to a Bicriteria Flowshop Problem

By Armentano Vinícius Amaral Claudio José Elias

Journal of Heuristics, Vol. 10, Iss. 5, 2004-09 ,pp. : 463-481

Springer Publishing Company

Access to resources Recommend Favorite

The application of a tabu search metaheuristic to the assembly line balancing problem

By Chiang W-C.

Annals of Operations Research, Vol. 77, Iss. 1, 1998-01 ,pp. : 209-227

Springer Publishing Company

Access to resources Recommend Favorite