INTRODUCTION The Metaheuristics are general strategies for designing heuristic procedures with high performance. The term metaheuristic, which appeared in 1986 for the first time (Glover, 1986), is compound by the terms: " meta " , that means over or behind, and " heuristic ". Heuristic is the qualifying used for methods of solving optimization problems that are obtained from the intuition, exp...

The generalized vertex cover problem (GVCP) was recently introduced in the literature and modeled as a binary linear program. GVCP extends classic vertex cover problems to include both node and edgeweights in the objective function. Due to reported difficulties in finding good solutions for even modest sized problems via the use of exactmethods (CPLEX), heuristic solutions obtained from a custo...

This paper presents a highly effective memetic algorithm for the maximum diversity problem based on tabu search. The tabu search component uses a successive filter candidate list strategy and the solution combination component employs a combination operator based on identifying strongly determined and consistent variables. Computational experiments on three sets of 40 popular benchmark instance...

Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fischetti, Glover and Lodi proposed a heuristic scheme for finding a feasible solution to general MIPs, called Feasibility Pump (FP). According to the computational analysis reported by these authors, FP is indeed quite eff...

Abstract Endophytic microorganisms reside within plant tissues and have often been found to promote plant growth. In this study, endophytic microorganisms were isolated from the roots, stems, leaves, and seeds of healthy drunken horse grass, Achnatherum inebrians (Hance) Keng (Poales: Poaceae), through the use of a grinding separation method and identified by a dual approach of morphological an...