• Publications
  • Influence
Multistart Iterated Tabu Search for Bandwidth Coloring Problem
TLDR
This paper presents a Multistart Iterated Tabu Search (MITS) algorithm for solving Bandwidth Coloring Problem (BCP) and Bandwidth MultiColoring problem (BMCP). Expand
  • 19
  • 3
Path relinking for the fixed spectrum frequency assignment problem
TLDR
We introduce a population-based path relinking method to solve the fixed spectrum frequency assignment problem (FS-FAP). Expand
  • 17
  • 2
  • PDF
A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
TLDR
In this work, we present an effective two-phase tabu-evolutionary algorithm for solving the 0–1 multidimensional knapsack problem. Expand
  • 17
  • 2
  • PDF
Backtracking based iterated tabu search for equitable coloring
TLDR
An equitable k-coloring of an undirected graph G = ( V , E ) is a partition of its vertices into k disjoint independent sets. Expand
  • 10
  • 2
  • PDF
On feasible and infeasible search for equitable graph coloring
TLDR
An equitable legal k-coloring of an undirected graph G = (V, E) is a partition of the vertex set V into k disjoint independent sets such that the cardinalities of any two independent sets differ by at most one (this is called the equity constraint). Expand
  • 4
  • 2
A tabu search based memetic algorithm for the max-mean dispersion problem
TLDR
We present a tabu search based memetic algorithm for MaxMeanDP which relies on solution recombination and local optimization to find high quality solutions. Expand
  • 23
  • 1
  • PDF
Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
TLDR
We investigate for the first time how solution-based tabu search can be used to solve the multidemand multidimensional knapsack problem. Expand
  • 11
  • 1
  • PDF
Path Relinking for Bandwidth Coloring Problem
TLDR
A Path Relinking algorithm is proposed for Bandwidth Coloring problem and the Bandwidth MultiColoring problem. Expand
  • 6
  • 1
  • PDF
Geometry optimization of atomic clusters using a heuristic method with dynamic lattice searching.
In this paper, a global optimization method is presented to determine the global-minimum structures of atomic clusters, where several already existing techniques are combined, such as the dynamicExpand
  • 17
Structural optimization of silver clusters from Ag141 to Ag310 using a Modified Dynamic Lattice Searching method with Constructed core
Abstract The structures of silver clusters from Ag 141 to Ag 310 are systematically optimized with a modified version of the dynamic lattice searching method with constructed core (DLSc). TheExpand
  • 18